749 search results - page 112 / 150 » Dualities for Constraint Satisfaction Problems |
170
Voted
STDBM
2004
Springer
15 years 9 months ago
2004
Springer
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
156
Voted
AAAI
2007
15 years 6 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
139
Voted
AI
1999
Springer
15 years 3 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
153
Voted
CP
2011
Springer
14 years 3 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
146
Voted
CONSTRAINTS
2007
15 years 3 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...