2988 search results - page 401 / 598 » Experiments with a New Boosting Algorithm |
163
click to vote
AADEBUG
2005
Springer
15 years 8 months ago
2005
Springer
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
142
click to vote
CGO
2004
IEEE
15 years 6 months ago
2004
IEEE
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
127
click to vote
AAAI
2010
15 years 4 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
125
click to vote
JPDC
1998
15 years 2 months ago
1998
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
179
click to vote
JMLR
2010
14 years 9 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...