Sciweavers

3225 search results - page 73 / 645
» Compiling Experience into Knowledge
Sort
View
ENTCS
2007
84views more  ENTCS 2007»
15 years 1 months ago
Inductive Reasoning and Programming Visualization, an Experiment Proposal
We lay down plans to study how Inductive Reasoning Ability (IRA) affects the analyzing and understanding of Program Visualization (PV) systems. Current PV systems do not take int...
Andrés Moreno, Niko Myller, Erkki Sutinen, ...
ACL
2010
14 years 12 months ago
Experiments in Graph-Based Semi-Supervised Learning Methods for Class-Instance Acquisition
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...
Partha Pratim Talukdar, Fernando Pereira
DAC
2009
ACM
16 years 2 months ago
WCET-aware register allocation based on graph coloring
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
Heiko Falk
PLDI
1992
ACM
15 years 6 months ago
Debugging Optimized Code with Dynamic Deoptimization
: SELF's debugging system provides complete source-level debugging (expected behavior) with globally optimized code. It shields the debugger from optimizations performed by th...
Urs Hölzle, Craig Chambers, David Ungar
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 5 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...