5230 search results - page 23 / 1046 » Dynamic Optimality -- Almost |
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
COLT
2010
Springer
13 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...