2393 search results - page 69 / 479 » Bounds-Consistent Local Search |
84
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
121
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
CP
2003
Springer
15 years 5 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
108
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
111
click to vote
CP
2004
Springer
15 years 4 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...