Sciweavers

980 search results - page 87 / 196
» Decentralized Constraint Satisfaction
Sort
View
AUSAI
2005
Springer
14 years 4 days ago
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
Stuart Bain, John Thornton, Abdul Sattar
FLAIRS
2003
13 years 11 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 10 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
PPSN
1998
Springer
14 years 2 months 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
ICSE
2004
IEEE-ACM
14 years 10 months ago
Extending the Representational State Transfer (REST) Architectural Style for Decentralized Systems
Because it takes time and trust to establish agreement, traditional consensus-based architectural styles cannot safely accommodate resources that change faster than it takes to tr...
Rohit Khare, Richard N. Taylor