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....
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding ...
Documents, especially long ones, may contain very diverse passages related to different topics. Passages Retrieval approaches have shown that, in most cases, there is a great pote...
Sylvain Lamprier, Tassadit Amghar, Bernard Levrat,...
: Although instant messaging is a very popular tool for collaboration and it has been used for a wide variety of CSCL tasks, there are only a few applications for assisting the tut...
Mihai Dascalu, Erol-Valeriu Chioasca, Stefan Traus...
Abstract This paper attempts to define an emotional model for virtual agents that behave autonomously in social worlds. We adopt shallow modeling based on the decomposition of the...
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...