4342 search results - page 150 / 869 » Improved Algorithms for Optimal Embeddings |
121
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
170
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
160
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
156
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
137
click to vote
TOC
2008
15 years 4 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...