2108 search results - page 130 / 422 » Constrained Heuristic Search |
102
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
120
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Managing large-scale software projects involves a number of activities such as viewpoint extraction, feature detection, and requirements management, all of which require a human a...
136
click to vote
PR
2008
15 years 1 months ago
2008
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
167
click to vote
EVOW
2009
Springer
15 years 8 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
106
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...