72 search results - page 13 / 15 » Random search can outperform mutation |
JAIR
2007
14 years 9 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Shared grammar evolution (SGE) is a novel scheme for representing and evolving a population of variablelength programs as a shared set of grammatical productions. Productions t...
106
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Detecting objects in cluttered scenes and estimating articulated human body parts are two challenging problems in computer vision. The difficulty is particularly pronounced in ac...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
86
Voted
AAAI
2004
14 years 11 months ago
2004
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...