Sciweavers

1381 search results - page 40 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
12 years 3 days ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
LISA
2008
14 years 16 hour ago
Designing Tools for System Administrators: An Empirical Test of the Integrated User Satisfaction Model
System administrators are unique computer users. As power users in complex and high-risk work environments, intuition tells us that they may have requirements of the tools they us...
Nicole F. Velasquez, Suzanne P. Weisband, Alexandr...
AAAI
2006
13 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
AI
1999
Springer
13 years 9 months ago
Emergent Cooperative Goal-Satisfaction in Large Scale Automated-Agent Systems
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
Onn Shehory, Sarit Kraus, Osher Yadgar
WETICE
1996
IEEE
14 years 1 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