Sciweavers

641 search results - page 1 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
AAAI
1998
13 years 6 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CCE
2008
13 years 4 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
ICCD
2002
IEEE
110views Hardware» more  ICCD 2002»
14 years 1 months ago
Branch Predictor Prediction: A Power-Aware Branch Predictor for High-Performance Processors
We introduce Branch Predictor Prediction (BPP) as a power-aware branch prediction technique for high performance processors. Our predictor reduces branch prediction power dissipat...
Amirali Baniasadi, Andreas Moshovos
DMIN
2007
203views Data Mining» more  DMIN 2007»
13 years 6 months ago
Evaluation of Feature Selection Techniques for Analysis of Functional MRI and EEG
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
Lauren Burrell, Otis Smart, George J. Georgoulas, ...
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
13 years 9 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis