Sciweavers

1813 search results - page 150 / 363
» Instance Pruning Techniques
Sort
View
ASPDAC
2007
ACM
117views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Short-Circuit Compiler Transformation: Optimizing Conditional Blocks
Abstract-- We present the short-circuit code transformation technique, intended for embedded compilers. The transformation technique optimizes conditional blocks in high-level prog...
Mohammad Ali Ghodrat, Tony Givargis, Alex Nicolau
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
15 years 10 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
AVI
2008
15 years 8 months ago
Users' quest for an optimized representation of a multi-device space
A plethora of reaching techniques, intended for moving objects between locations distant to the user, have recently been proposed and tested. One of the most promising techniques i...
Dzmitry Aliakseyeu, Andrés Lucero, Jean-Ber...
ACL
1998
15 years 7 months ago
Experiments with Learning Parsing Heuristics
Any large language processing software relies in its operation on heuristic decisions concerning the strategy of processing. These decisions are usually "hard-wired" int...
Sylvain Delisle, Sylvain Létourneau, Stan M...
WCET
2003
15 years 7 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper