78 search results - page 4 / 16 » Tabu Search Based Circuit Optimization |
IJAIT
2007
13 years 7 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
LION
2009
Springer
14 years 1 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
JUCS
2008
13 years 7 months ago
2008
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...