5316 search results - page 23 / 1064 » Which Search Problems Are Random |
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
109
click to vote
AI
2003
Springer
15 years 5 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
118
click to vote
ACSW
2004
15 years 2 months ago
2004
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...
FOCI
2007
IEEE
15 years 7 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...