10901 search results - page 327 / 2181 » Approximations in Distributed Optimization |
190
click to vote
ARC
2007
Springer
15 years 6 months ago
2007
Springer
General delay dynamical systems in which uncertainty is present in the form of probability measure dependent dynamics are considered. Several motivating examples arising in biolog...
209
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
228
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
151
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
221
click to vote
IPCO
2001
15 years 8 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...