Sciweavers

968 search results - page 28 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
HIPEAC
2005
Springer
14 years 1 months ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...
DFT
2000
IEEE
119views VLSI» more  DFT 2000»
14 years 2 days ago
An Experimental Evaluation of the Effectiveness of Automatic Rule-Based Transformations for Safety-Critical Applications
1 Over the last years, an increasing number of safety-critical tasks have been demanded to computer systems. In particular, safety-critical computer-based applications are hitting ...
Maurizio Rebaudengo, Matteo Sonza Reorda, Marco To...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICPR
2006
IEEE
14 years 8 months ago
Automatic Adjacency Grammar Generation from User Drawn Sketches
In this paper we present an innovative approach to automatically generate adjacency grammars describing graphical symbols. A grammar production is formulated in terms of rulesets ...
Joan Mas Romeu, Bart Lamiroy, Gemma Sánchez...
ESOA
2006
13 years 11 months ago
Reinforcement Learning for Online Control of Evolutionary Algorithms
The research reported in this paper is concerned with assessing the usefulness of reinforcment learning (RL) for on-line calibration of parameters in evolutionary algorithms (EA). ...
A. E. Eiben, Mark Horvath, Wojtek Kowalczyk, Marti...