7930 search results - page 1166 / 1586 » Greedy in Approximation Algorithms |
172
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...
183
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...
166
click to vote
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...
205
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....
162
click to vote
DIS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...