Sciweavers

641 search results - page 40 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
JMLR
2012
13 years 4 days ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 1 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
BROADNETS
2005
IEEE
15 years 3 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolutionary rule-based system for IPO underpricing prediction
Academic literature has documented for a long time the existence of important price gains in the first trading day of initial public offerings (IPOs). Most of the empirical analys...
David Quintana, Cristóbal Luque del Arco-Ca...