Sciweavers

858 search results - page 40 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
AGENTS
2001
Springer
14 years 6 days ago
Argumentation as distributed constraint satisfaction: applications and results
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
Hyuckchul Jung, Milind Tambe, Shriniwas Kulkarni
ATAL
2001
Springer
14 years 6 days ago
Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
JUCS
2007
118views more  JUCS 2007»
13 years 7 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
CORR
2011
Springer
160views Education» more  CORR 2011»
12 years 11 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 5 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer