Sciweavers

6514 search results - page 643 / 1303
» Low-Knowledge Algorithm Control
Sort
View
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 10 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
15 years 10 months ago
Pareto-coevolutionary genetic programming classifier
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...
Michal Lemczyk, Malcolm I. Heywood
CP
1995
Springer
15 years 10 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
ISCAPDCS
2001
15 years 8 months ago
Bandwidth Learning in Distributed Networking Environments for Global Information Dissemination
- This work investigates bandwidth learning algorithms in a version of a distributed heterogeneous data dissemination system called the Agile Information Control Environment (AICE)...
Craig Sullivan, Michael Jurczyk
182
Voted
AAAI
2000
15 years 8 months ago
Collective Intelligence and Braess' Paradox
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 ...
Kagan Tumer, David Wolpert