Sciweavers

968 search results - page 68 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
MIDDLEWARE
2010
Springer
13 years 8 months ago
Automatically Generating Symbolic Prefetches for Distributed Transactional Memories
Abstract. Developing efficient distributed applications while managing complexity can be challenging. Managing network latency is a key challenge for distributed applications. We ...
Alokika Dash, Brian Demsky
ICANN
2007
Springer
14 years 4 months ago
Selection of Decision Stumps in Bagging Ensembles
Abstract. This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble p...
Gonzalo Martínez-Muñoz, Daniel Hern&...
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
14 years 3 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton
IJCIA
2006
88views more  IJCIA 2006»
13 years 10 months ago
Multi-Learner Based Recursive Supervised Training
In this paper, we propose the Multi-Learner Based Recursive Supervised Training (MLRT) algorithm which uses the existing framework of recursive task decomposition, by training the...
Laxmi R. Iyer, Kiruthika Ramanathan, Sheng Uei Gua...
IPPS
2006
IEEE
14 years 4 months ago
Selection of instruction set extensions for an FPGA embedded processor core
A design process is presented for the selection of a set of instruction set extensions for the PowerPC 405 processor that is embedded into the Xilinx Virtex Family of FPGAs. The i...
Brian F. Veale, John K. Antonio, Monte P. Tull, S....