Sciweavers

97 search results - page 10 / 20
» Algorithms for Distributed Constraint Satisfaction: A Review
Sort
View
PPSN
1998
Springer
14 years 26 days ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley
JAIR
2000
94views more  JAIR 2000»
13 years 8 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
14 years 1 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
ECAI
2006
Springer
14 years 10 days ago
Distributed Log-Based Reconciliation
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
Yek Loong Chong, Youssef Hamadi
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
William G. Macready, David Wolpert