Sciweavers

388 search results - page 54 / 78
» Source-level execution time estimation of C programs
Sort
View
ECML
2006
Springer
13 years 11 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
LCTRTS
2007
Springer
14 years 1 months ago
Addressing instruction fetch bottlenecks by using an instruction register file
The Instruction Register File (IRF) is an architectural extension for providing improved access to frequently occurring instructions. An optimizing compiler can exploit an IRF by ...
Stephen Roderick Hines, Gary S. Tyson, David B. Wh...
SIGMETRICS
2003
ACM
106views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
On the effectiveness of movement prediction to reduce energy consumption in wireless communication
—Node movement can be exploited to reduce the energy consumption of wireless network communication. The strategy consists in delaying communication until a mobile node moves clos...
Srijan Chakraborty, David K. Y. Yau, John C. S. Lu...
EUROSYS
2006
ACM
14 years 4 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
ISCA
2007
IEEE
146views Hardware» more  ISCA 2007»
14 years 2 months ago
Automated design of application specific superscalar processors: an analytical approach
Analytical modeling is applied to the automated design of application-specific superscalar processors. Using an analytical method bridges the gap between the size of the design sp...
Tejas Karkhanis, James E. Smith