Sciweavers

3415 search results - page 478 / 683
» Lower bounds on kernelization
Sort
View
COLT
2010
Springer
15 years 4 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
COLT
2010
Springer
15 years 4 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 3 months ago
Two-Way Transmission Capacity of Wireless Ad-hoc Networks
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...
Rahul Vaze, Kien T. Truong, Steven Weber, Robert W...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
15 years 1 months ago
Stability analysis of networked control systems: A sum of squares approach
This paper presents a sum of squares (SOS) approach to the stability analysis of networked control systems (NCSs) incorporating time-varying delays and time-varying transmission in...
Nicolas William Bauer, Paul J. H. Maas, W. P. M. H...
CN
2011
88views more  CN 2011»
15 years 1 months ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...