Sciweavers

2252 search results - page 83 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
OPODIS
2008
15 years 3 months ago
On the Time-Complexity of Robust and Amnesic Storage
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
Dan Dobre, Matthias Majuntke, Neeraj Suri
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
16 years 2 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
IJCAI
2007
15 years 3 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
RECOMB
2006
Springer
16 years 1 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...
IPPS
2006
IEEE
15 years 7 months ago
QoS-based management of multiple shared resource in dynamic real-time systems
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
Klaus H. Ecker, Frank Drews, Jens Lichtenberg