2376 search results - page 248 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
82
Voted
TSI
2008
14 years 10 months ago
2008
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 ...
GLOBECOM
2008
IEEE
14 years 11 months ago
2008
IEEE
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 ...
84
Voted
ECML
2006
Springer
15 years 2 months ago
2006
Springer
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...
99
Voted
STOC
1994
ACM
15 years 2 months ago
1994
ACM
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...
107
Voted
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
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...