2899 search results - page 415 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
158
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
124
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
140
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Most previous work in statistical multiplexing only considered the case where the link transmission rates are fixed. In this paper, we consider statistical multiplexing in net...
135
click to vote
WABI
2007
Springer
15 years 11 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
116
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...