459 search results - page 76 / 92 » Computational Complexity of Probabilistic Disambiguation |
140
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
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...
126
Voted
RECSYS
2010
ACM
15 years 4 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
127
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
132
click to vote
JBI
2008
15 years 3 months ago
2008
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
118
click to vote
JACM
2006
15 years 3 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...