2108 search results - page 190 / 422 » Constrained Heuristic Search |
187
click to vote
CP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
182
click to vote
AIPS
2008
15 years 8 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
171
click to vote
KER
2007
15 years 6 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
145
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes ...
184
click to vote
ICPR
2008
IEEE
16 years 29 days ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...