Sciweavers

2376 search results - page 248 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
TSI
2008
89views more  TSI 2008»
13 years 8 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
GLOBECOM
2008
IEEE
13 years 8 months ago
Power Allocation for Cognitive Radios Based on Primary User Activity in an OFDM System
Efficient and reliable power allocation algorithm in Cognitive radio (CR) networks is a challenging problem. Traditional water-filling algorithm is inefficient for CR networks due ...
Ziaul Hasan, Ekram Hossain, Charles L. Despins, Vi...
ECML
2006
Springer
13 years 12 months ago
Bandit Based Monte-Carlo Planning
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
Levente Kocsis, Csaba Szepesvári
STOC
1994
ACM
95views Algorithms» more  STOC 1994»
13 years 11 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
13 years 8 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...