451 search results - page 21 / 91 » Approximation algorithms for stochastic orienteering |
106
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
115
Voted
UAI
2004
15 years 1 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
106
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
AAAI
2008
15 years 2 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
116
click to vote
TCS
2008
15 years 11 days ago
2008
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...