1300 search results - page 157 / 260 » Constraint satisfaction problems and global cardinality cons... |
184
click to vote
AAAI
2007
15 years 8 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 ...
182
click to vote
AI
1999
Springer
15 years 6 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...
200
click to vote
CP
2011
Springer
14 years 6 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.,...
159
click to vote
CVPR
2008
IEEE
16 years 24 days ago
2008
IEEE
We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a-posteriori (MAP) data association problem is mapped in...
185
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...