Sciweavers

727 search results - page 42 / 146
» Two thresholds are better than one
Sort
View
STACS
2005
Springer
14 years 1 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
UAI
2001
13 years 9 months ago
Vector-space Analysis of Belief-state Approximation for POMDPs
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
Pascal Poupart, Craig Boutilier
HT
2003
ACM
14 years 27 days ago
Do adaptation rules improve web cost estimation?
Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorith...
Emilia Mendes, Nile Mosley, Steve Counsell
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 12 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
BMCBI
2008
89views more  BMCBI 2008»
13 years 7 months ago
Increasing the efficiency of bacterial transcription simulations: When to exclude the genome without loss of accuracy
Background: Simulating the major molecular events inside an Escherichia coli cell can lead to a very large number of reactions that compose its overall behaviour. Not only should ...
Marco A. J. Iafolla, Guang Qiang Dong, David R. Mc...