7930 search results - page 1167 / 1586 » Greedy in Approximation Algorithms |
190
click to vote
AAAI
2010
15 years 8 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...
205
click to vote
CCCG
2010
15 years 8 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
170
click to vote
CATS
2007
15 years 8 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
204
click to vote
COLOGNETWENTE
2008
15 years 8 months ago
2008
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
174
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...