7006 search results - page 1016 / 1402 » Approximation Algorithms |
191
click to vote
AIPS
2007
15 years 9 months ago
2007
High-level actions (HLAs) lie at the heart of hierarchical planning. Typically, an HLA admits multiple refinements into primitive action sequences. Correct descriptions of the ef...
171
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
182
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
165
Voted
EPEW
2006
Springer
15 years 8 months ago
2006
Springer
This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an...
204
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....