1914 search results - page 2 / 383 » Evaluation of a Catalytic Search Algorithm |
SIGMOD
2012
ACM
11 years 8 months ago
2012
ACM
When working on a new project, researchers need to devote a significant amount of time and effort to surveying the relevant literature. This is required in order to gain experti...
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
13 years 4 months ago
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
EPEW
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. Distributed security models based on a ‘web of trust’ eliminate single points of failure and alleviate performance bottlenecks. However, such distributed approaches r...
JAR
2000
13 years 6 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
CGO
2007
IEEE
14 years 18 days ago
2007
IEEE
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...