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)
-
361
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 -
362
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 -
363
-
364
PERF solutions for distributed query optimization. (c1999)
Published 1999Get full text
Get full text
masterThesis -
365
Graph Contraction for Mapping Data on Parallel Computers
Published 1994“…We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). …”
Get full text
Get full text
Get full text
article -
366
Graph contraction for physical optimization methods
Published 1993“…We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
367
HPTS: heterogeneous parallel tabu search for VLSI placement
Published 2002“…Two parallelization strategies, i.e., functional decomposition and multi-search thread strategies are integrated. The proposed algorithm is tested on the VLSI standard cell placement problem, however, the same algorithm can be used on any combinatorial optimization problem. …”
Get full text
Get full text
article -
368
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 -
369
Joint Planning of Smart EV Charging Stations and DGs in Eco-Friendly Remote Hybrid Microgrids
Published 2019“…This is achieved by iteratively solving a multi-objective mixed integer non-linear program. An outer sub-problem determines the locations and sizes of the DG units and charging stations using a non-dominated sorting Genetic algorithm (NSGA-II). …”
Get full text
article -
370
Four-dimensional representation and collision detection for movingobjects
Published 1998“…Simulation results on some example problems are given, and show that the algorithm is superior to those available in the literature…”
Get full text
Get full text
article -
371
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 -
372
-
373
Meta Reinforcement Learning for UAV-Assisted Energy Harvesting IoT Devices in Disaster-Affected Areas
Published 2024“…We conducted extensive simulations and compared our approach with two state-of-the-art models using traditional RL algorithms represented by a deep Q-network algorithm, a Particle Swarm Optimization (PSO) algorithm, and one greedy solution. …”
-
374
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 -
375
On Single Source Reachability Improvement
Published 2022“…We show the NP hardness and present an effective polynomial-time greedy algorithm. Experimental evaluation of our greedy algorithm is conducted on randomly generated graphs, using the Erdos-Renyi approach. …”
Get full text
Get full text
Get full text
masterThesis -
376
Shuffled Linear Regression with Erroneous Observations
Published 2019“…This paper tackles this problem in its full generality using stochastic approximation, which is based on a first-order permutation-invariant constraint. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
377
Unit commitment by tabu search
Published 1998“…The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. …”
Get full text
Get full text
article -
378
Final exams scheduling for univeristies. (c2001)
Published 2001Get full text
Get full text
masterThesis -
379
Implementation of a Multivariable Modular Structure for Fuzzy Taxi Scheduling System (FTSS)
Published 2014“…This paper describes the implementation of a hybridized intelligent algorithm to reach a decision under uncertainty and to tune the possible solution using genetic algorithm. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
380
Approximate XML structure validation based on document–grammar tree similarity
Published 2015“…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?…”
Get full text
Get full text
Get full text
Get full text
article