Sciweavers

407 search results - page 65 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
PE
2010
Springer
102views Optimization» more  PE 2010»
14 years 8 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
POPL
2010
ACM
15 years 7 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
15 years 6 months ago
Battery-aware power management based on Markovian decision processes
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...
Peng Rong, Massoud Pedram
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 1 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig