Sciweavers

1002 search results - page 59 / 201
» Constraint Answer Set Solving
Sort
View
ATAL
2005
Springer
14 years 1 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
CAD
2004
Springer
13 years 8 months ago
Choosing consistent constraints for beautification of reverse engineered geometric models
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ECCV
2004
Springer
14 years 10 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm