Sciweavers

85 search results - page 6 / 17
» A Hybrid Approach to Distributed Constraint Satisfaction
Sort
View
AIMSA
2008
Springer
14 years 11 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
AAAI
2000
14 years 11 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
SETN
2004
Springer
15 years 2 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
NETGAMES
2006
ACM
15 years 3 months ago
Peer clustering: a hybrid approach to distributed virtual environments
This paper proposes a hybrid architecture for distributed virtual environments, utilizing servers alongside peer-to-peer components. Current research into peer-based systems seeks...
Alvin Chen, Richard R. Muntz
JMLR
2012
13 years 1 days ago
Deterministic Annealing for Semi-Supervised Structured Output Learning
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
Paramveer S. Dhillon, S. Sathiya Keerthi, Kedar Be...