Sciweavers

7228 search results - page 55 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
GECCO
2006
Springer
187views Optimization» more  GECCO 2006»
15 years 1 months ago
The gregarious particle swarm optimizer (G-PSO)
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
Srinivas Pasupuleti, Roberto Battiti
CC
2010
Springer
135views System Software» more  CC 2010»
14 years 10 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
PODC
2010
ACM
15 years 1 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
ERSA
2006
150views Hardware» more  ERSA 2006»
14 years 11 months ago
An Area Time Efficient Field Programmable Mersenne Twister Uniform Random Number Generator
Reconfigurable computing offers an attractive solution to accelerating infrared scene simulations. In infrared scene simulations, the modeling of a number of atmospheric and optic...
Vinay Sriram, David Kearney
ALT
2008
Springer
15 years 6 months ago
Prequential Randomness
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
Vladimir Vovk, Alexander Shen