Sciweavers

711 search results - page 32 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
TCS
2010
14 years 10 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
AAAI
1996
15 years 1 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
Peggy S. Eaton, Eugene C. Freuder
IJIT
2004
15 years 1 months ago
An Evolutionary Algorithm to Solve Cryptarithmetic Problem
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
Abu Sayef Md. Ishaque, Md. Bahlul Haider, Muhammad...
IADIS
2003
15 years 1 months ago
Adaptive Hypermedia Systems Featuring Information Customization Using Constraint Satisfaction Methods
We present an Information Customization framework, which offers a unique hybrid of Adaptive Hypermedia and Constraint Satisfaction methods. IC is being modelled as a constraint sa...
Chong Yan Han, Syed Sibte Raza Abidi, Yu-N Cheah
AAMAS
2000
Springer
14 years 11 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
Makoto Yokoo, Katsutoshi Hirayama