1080 search results - page 52 / 216 » Problem dependent optimization (PDO) |
158
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
168
click to vote
APPROX
2005
Springer
16 years 17 hour ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
181
click to vote
AAAI
2008
15 years 8 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
186
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
173
click to vote
EMO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...