10909 search results - page 573 / 2182 » Evaluating Backup Algorithms |
202
click to vote
ICDM
2003
IEEE
16 years 11 days ago
2003
IEEE
We propose and evaluate a family of methods for converting classifier learning algorithms and classification theory into cost-sensitive algorithms and theory. The proposed conve...
191
click to vote
PAAMS
2010
Springer
15 years 12 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
163
click to vote
CP
1997
Springer
15 years 11 months ago
1997
Springer
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
179
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
179
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper proposes an efficient algorithm that produces near-optimal discrete bit-loading for a Gaussian interference channel that models a DSL network. It first takes a continuou...