728 search results - page 22 / 146 » Efficient Searching with Linear Constraints |
137
click to vote
AIPS
2010
15 years 3 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
127
Voted
IJCAI
1989
15 years 3 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
127
click to vote
IAT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
119
Voted
HEURISTICS
2002
15 years 1 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
106
Voted
AAAI
1990
15 years 3 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...