Sciweavers

810 search results - page 118 / 162
» Solving Time-Dependent Planning Problems
Sort
View
CSE
2009
IEEE
14 years 2 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
AIMSA
2008
Springer
14 years 2 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
14 years 2 months ago
Design closure driven delay relaxation based on convex cost network flow
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...
Chuan Lin, Aiguo Xie, Hai Zhou
AIPS
2008
13 years 10 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
DIMACS
2001
13 years 9 months ago
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
Ileana Streinu