2089 search results - page 124 / 418 » Finding Environment Guarantees |
115
click to vote
AIPS
2010
15 years 6 months ago
2010
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
135
click to vote
WSC
2008
15 years 6 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
134
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
147
click to vote
SIROCCO
2010
15 years 5 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
137
click to vote
UAI
2008
15 years 5 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...