115 search results - page 14 / 23 » Bounds on the Number of Maximal Sum-Free Sets |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
ALGORITHMICA
2011
12 years 11 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
SIROCCO
2007
13 years 9 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We study the downlink coverage of a base station terminal (BST), which has access to a relay node. Continuing a previous study in which the BST is assumed to provide a variable...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...