33356 search results - page 6481 / 6672 » Models of Continual Computation |
170
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
166
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
170
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
179
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
183
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The amount of information stemming from proteomics experiments involving (multi dimensional) separation techniques, mass spectrometric analysis, and computational anal...