Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
- This work investigates bandwidth learning algorithms in a version of a distributed heterogeneous data dissemination system called the Agile Information Control Environment (AICE)...
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...