Sciweavers

1453 search results - page 113 / 291
» Partial Constraint Satisfaction
Sort
View
WETICE
1996
IEEE
15 years 8 months ago
A constraint-based model of coordination in concurrent design projects
Communication and coordination play an important role in achieving concurrency in the design of large complex artifacts. It is also widely accepted that design is constraint orien...
Lokesh Gupta, John F. Chionglo, Mark S. Fox
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
154
Voted
UAI
1997
15 years 5 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
ATAL
2003
Springer
15 years 9 months ago
Performance models for large scale multiagent systems: using distributed POMDP building blocks
Given a large group of cooperative agents, selecting the right coordination or conflict resolution strategy can have a significant impact on their performance (e.g., speed of co...
Hyuckchul Jung, Milind Tambe
133
Voted
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 9 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...