Sciweavers

4372 search results - page 272 / 875
» Algorithmic Theories of Everything
Sort
View
AIPS
2006
15 years 7 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
TEC
2008
149views more  TEC 2008»
15 years 5 months ago
Biogeography-Based Optimization
Abstract--We propose a novel variation to biogeographybased optimization (BBO), which is an evolutionary algorithm (EA) developed for global optimization. The new algorithm employs...
Dan Simon
JACM
2010
116views more  JACM 2010»
15 years 4 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára