Sciweavers

955 search results - page 35 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
NSDI
2007
13 years 10 months ago
Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
Bernard Wong, Ivan Stoyanov, Emin Gün Sirer
AIMSA
2008
Springer
13 years 10 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
CP
2004
Springer
14 years 1 months ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
SAC
2010
ACM
14 years 2 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
ATAL
2007
Springer
14 years 2 months ago
Unifying distributed constraint algorithms in a BDI negotiation framework
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Bao Chau Le Dinh, Kiam Tian Seow