Sciweavers

82 search results - page 12 / 17
» Yet Another Local Search Method for Constraint Solving
Sort
View
AAAI
2000
14 years 11 months ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier
CVPR
2004
IEEE
15 years 11 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
ATAL
2005
Springer
15 years 3 months ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
ICTAI
2003
IEEE
15 years 2 months ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen
AI
2000
Springer
14 years 9 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...