Sciweavers

501 search results - page 45 / 101
» An Upper Bound on the Number of Rectangulations of a Point S...
Sort
View
COLT
2010
Springer
13 years 5 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
ICC
2007
IEEE
14 years 1 months ago
Partial Decoding for Synchronous and Asynchronous Gaussian Multiple Relay Channels
— Relaying diversity is a key technology to increase capacity in wireless networks. In this paper, the capacity of a single source-destination wireless channel, aided by a set of...
Aitor del Coso, Christian Ibars
CCCG
2010
13 years 9 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 7 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 7 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli