627 search results - page 117 / 126 » Branched Polyhedral Systems |
ICTAC
2004
Springer
14 years 25 days ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
SAINT
2003
IEEE
14 years 22 days ago
2003
IEEE
To cope with the various problems arising from Internet protocol such as scarcity of IP addresses in the Internet and increase in the number of paths, research and development has...
AGP
2010
IEEE
14 years 17 days ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
IEEEPACT
2000
IEEE
13 years 12 months ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
MICRO
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper provides quantitative measurements of load latency tolerance in a dynamically scheduled processor. To determine the latency tolerance of each memory load operation, our...