Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
backing » banking (Expand Search), lacking (Expand Search), packing (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
backing » banking (Expand Search), lacking (Expand Search), packing (Expand Search)
-
181
A linear programming approach for the weighted graph matchingproblem
Published 1993“…The linear program is solved using a simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
Get full text
Get full text
article -
182
Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine
Published 2020“…In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. …”
Get full text
article -
183
Methods for system-on-chip test design, scheduling and optimization. (c2006)
Published 2006Get full text
Get full text
masterThesis -
184
Newton-Raphson based adaptive inverse control scheme for tracking of nonlinear dynamic plants
Published 2006“…The U-model is utilized to design an adaptive inverse controller by using a simple root-solving algorithm of Newton-Raphson. …”
Get full text
Get full text
article -
185
A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
Published 2020“…The linear program is solved using a Simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
Get full text
article -
186
Tabu search based circuit optimization
Published 1998“…The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. Only gates on the critical sensitizable paths are considered for optimization. …”
Get full text
Get full text
article -
187
Communications in electronic textile systems
Published 2017“…Abstract- Electronic textiles (e-textiles) are emerging as a novel method for constructing electronic systems in wearable and large area applications. …”
Get full text
Get full text
Get full text
conferenceObject -
188
Could Petrol Stations Play a Key Role in Transportation Electrification? A GIS-Based Coverage Maximization of Fast EV Chargers in Urban Environment
Published 2022“…The spatial optimization problem is solved using a linear-programming relaxation based MCLP algorithm developed in Python. …”
-
189
Robust tuning of power system stabilizers in multimachine powersystems
Published 2000“…A classical lead-lag power system stabilizer is used to demonstrate the technique. The problem of selecting the stabilizer parameters is converted to a simple optimization problem with an eigenvalue-based objective function, which is solved by a tabu search algorithm. …”
Get full text
Get full text
article -
190
Energy removal in dynamical systems through an optimal sequence of constraint application
Published 2017“…The optimization process is illustrated by means of simple mass-spring and membrane systems and the corresponding problems are solved using a genetic algorithm.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
191
Enhanced DC Microgrid Protection: a Neural Network and Wavelet Transform Approach
Published 2024Get full text
doctoralThesis -
192
Optimal shunt compensators at nonsinusoidal busbars
Published 1995“…The choice of the capacitor value is constrained by the values that may cause resonance. This model was solved employing the penalty function approach and the golden Section Search algorithm for solving the linear load case. …”
Get full text
Get full text
article -
193
An Evolutionary Meta-Heuristic for State Justification in Sequential Automatic Test Pattern Generation
Published 2001“…A common search optimization in sequential ATPG is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text
article -
194
An evolutionary meta-heuristic for state justification insequential automatic test pattern generation
Published 2001“…A common search operation in sequential ATPG is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text
Get full text
article -
195
OPTIMAL SHUNT COMPENSATORS AT NON-SINUSOIDAL BUSBARS
Published 2020“…The choice of the capacitor value is constrained by the values that may cause resonance. This model was solved employing the penalty function approach and the golden Section Search algorithm for solving the linear load case. …”
Get full text
article -
196
Power system output feedback stabilizer design via geneticalgorithms
Published 1997“…The paper demonstrates the use of genetic algorithms to design output feedback power system stabilizers. …”
Get full text
Get full text
article -
197
GenDE: A CRF-Based Data Extractor
Published 2020“…It verifies the site schema and extracts data from the Web pages using Conditional Random Fields (CRFs). The problem is solved by breaking down an observation sequence (a Web page) into simpler subsequences that will be labeled using CRF. …”
Get full text
Get full text
-
198
Autonomous Vehicles Delivery Systems: Analyzing Vehicle Routing Problems with a Moving Depot
Published 2019Get full text
doctoralThesis -
199
A modified optimal design of a vibration absorber for ground motion isolation
Published 2014“…Recently, a new vibration absorber setup was proposed where the absorber is placed between the dynamic system and its moving support. The problem was solved and design guidelines were proposed using the classical absorber design technique. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
200
Degree-Based Network Anonymization
Published 2020“…A corresponding graph realization approach is introduced based on a reduction to the Weighted Edge Cover problem, which in turn is solved using Integer Linear Programming to obtain the best possible solution. …”
Get full text
Get full text
Get full text
masterThesis