Sciweavers

1410 search results - page 212 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
148
Voted
ECCC
2010
106views more  ECCC 2010»
15 years 2 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
104
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
Veeraruna Kavitha, Eitan Altman, Rachid El Azouzi,...
159
Voted
JAIR
2010
115views more  JAIR 2010»
15 years 2 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
142
Voted
RAID
2010
Springer
15 years 2 months ago
Behavior-Based Worm Detectors Compared
Abstract. Many worm detectors have been proposed and are being deployed, but the literature does not clearly indicate which one is the best. New worms such as IKEE.B (also known as...
Shad Stafford, Jun Li
COLT
2010
Springer
15 years 1 months ago
Best Arm Identification in Multi-Armed Bandits
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
Jean-Yves Audibert, Sébastien Bubeck, R&eac...