2899 search results - page 269 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
256
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
158
click to vote
EMO
2005
Springer
16 years 6 days ago
2005
Springer
Water systems often allow efficient water uses via water reuse and/or recirculation. Defining the network layout connecting water-using processes is a complex problem which involv...
181
click to vote
GECCO
2008
Springer
15 years 7 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...
172
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
In this paper, we propose a new context-sensitive Bayesian learning algorithm. By modeling the distributions of data locations by a mixture of Gaussians, the new algorithm can uti...
190
click to vote
ACL
2010
15 years 4 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...