Sciweavers

85 search results - page 12 / 17
» A Hybrid Approach to Distributed Constraint Satisfaction
Sort
View
COLCOM
2007
IEEE
14 years 11 months ago
Maintaining constraints expressed as formulas in collaborative systems
—Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express con...
Kai Lin, David Chen, R. Geoff Dromey, Chengzheng S...
CP
2008
Springer
14 years 11 months ago
Connecting ABT with Arc Consistency
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
Ismel Brito, Pedro Meseguer
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 3 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
DSRT
2004
IEEE
15 years 1 months ago
Exploring the Spatial Density of Strategy Models in a Realistic Distributed Interactive Application
As Distributed Interactive Applications (DIAs) become increasingly more prominent in the video game industry they must scale to accommodate progressively more users and maintain a...
Damien Marshall, Declan Delaney, Séamus McL...
AMAI
2005
Springer
14 years 9 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan