7129 search results - page 996 / 1426 » Approximation Algorithms for Treewidth |
154
click to vote
CIKM
2008
Springer
15 years 6 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...
135
click to vote
EPEW
2006
Springer
15 years 6 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...
147
click to vote
PODS
2010
ACM
15 years 6 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....
130
click to vote
DIS
2008
Springer
15 years 6 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) ...
149
click to vote
AAAI
2010
15 years 6 months ago
2010
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...