511 search results - page 27 / 103 » Lower bounds for distributed markov chain problems |
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
JACM
2006
13 years 8 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...