Sciweavers

317 search results - page 37 / 64
» Benchmarking weak memory models
Sort
View
104
Voted
CGO
2007
IEEE
15 years 6 months ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...
93
Voted
PR
2007
104views more  PR 2007»
14 years 12 months ago
Optimizing resources in model selection for support vector machine
Tuning SVM hyperparameters is an important step in achieving a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the...
Mathias M. Adankon, Mohamed Cheriet
113
Voted
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 25 days ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
15 years 9 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
HPCA
2008
IEEE
16 years 24 days ago
Automated microprocessor stressmark generation
Estimating the maximum power and thermal characteristics of a processor is essential for designing its power delivery system, packaging, cooling, and power/thermal management sche...
Ajay M. Joshi, Lieven Eeckhout, Lizy Kurian John, ...