Sciweavers

2178 search results - page 241 / 436
» Inferring complex plans
Sort
View
ATAL
2005
Springer
15 years 9 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
ATAL
2004
Springer
15 years 9 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
ECCV
2004
Springer
15 years 9 months ago
AQUATICS Reconstruction Software: The Design of a Diagnostic Tool Based on Computer Vision Algorithms
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
Andrea Giachetti, Gianluigi Zanetti
ECAI
2000
Springer
15 years 8 months ago
A Framework for Dynamic Constraint Reasoning using Procedural Constraints
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
Ari K. Jónsson, Jeremy Frank
COMPGEOM
1994
ACM
15 years 8 months ago
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
Dan Halperin, Micha Sharir