434 search results - page 6 / 87 » Constraint-Based Combinators for Local Search |
120
click to vote
SCIA
2005
Springer
15 years 5 months ago
2005
Springer
This work proposes to learn visual encodings of attention patterns that enables sequential attention for object detection in real world environments. The system embeds a saccadic d...
100
Voted
PPDP
1999
Springer
15 years 3 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
107
Voted
GECCO
2000
Springer
15 years 3 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
115
Voted
AISC
2004
Springer
15 years 5 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
CEC
2010
IEEE
15 years 22 days ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...