5316 search results - page 61 / 1064 » Which Search Problems Are Random |
87
Voted
GECCO
2000
Springer
15 years 4 months ago
2000
Springer
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
80
Voted
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
112
click to vote
JAR
2000
15 years 18 days ago
2000
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
100
click to vote
COR
2010
15 years 27 days ago
2010
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...