Sciweavers

5316 search results - page 258 / 1064
» Which Search Problems Are Random
Sort
View
PPSN
2010
Springer
15 years 3 months ago
Towards Analyzing Recombination Operators in Evolutionary Search
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
Yang Yu, Chao Qian, Zhi-Hua Zhou
138
Voted
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 9 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
129
Voted
COR
2006
98views more  COR 2006»
15 years 5 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
INFOCOM
2005
IEEE
15 years 10 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
ICML
1996
IEEE
16 years 5 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez