1914 search results - page 42 / 383 » Evaluation of a Catalytic Search Algorithm |
AMAI
1999
Springer
13 years 8 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
APPINF
2003
13 years 10 months ago
2003
We develop a memory-efficient off-line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requir...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
Progressive sequence model refinement by means of iterative searches is an effective technique for high sensitivity database searches and is currently employed in popular tools s...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This work studies the mGA operator (Micro Genetic Algorithm), that has been proposed in literature as a “local search” operator for optimization with Genetic Algorithm. A new ...