641 search results - page 31 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
122
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
108
click to vote
NIPS
2000
15 years 3 months ago
2000
We introduce a method of feature selection for Support Vector Machines. The method is based upon finding those features which minimize bounds on the leave-one-out error. This sear...
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
122
click to vote
CGF
2006
15 years 1 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
108
click to vote
ALT
2008
Springer
15 years 10 months ago
2008
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...