Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
We present the systematic design and development of a distributed query scheduling service DQS in the context of DIOM, a distributed and interoperable query mediation system 26 ...
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...