551 search results - page 57 / 111 » Continuous Search in Constraint Programming |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
ICSE
2009
IEEE-ACM
14 years 2 months ago
2009
IEEE-ACM
As software systems continue to grow and evolve, locating code for maintenance and reuse tasks becomes increasingly difficult. Existing static code search techniques using natura...
AI
2006
Springer
13 years 7 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
EVOW
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...