416 search results - page 62 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
PODS
2001
ACM
14 years 7 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
SIGMETRICS
2004
ACM
14 years 29 days ago
2004
ACM
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
CDC
2009
IEEE
14 years 7 days ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...