28 search results - page 3 / 6 » Dynamic Representations and Escaping Local Optima: Improving... |
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 ...
PPSN
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We present an island model that uses different representations in each island. The model transforms individuals from one representation to another during migrations. We ...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we present a memetic algorithm with novel local optimizer hybridization strategy for constrained optimization. The developed MA consists of multiple cycles. In each ...
AIPS
2008
13 years 9 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...