Sciweavers

1291 search results - page 106 / 259
» Arithmetic program paths
Sort
View
COR
2008
128views more  COR 2008»
13 years 10 months ago
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
Mercedes Esteban-Bravo, Francisco J. Nogales
LISP
2008
70views more  LISP 2008»
13 years 10 months ago
Program transformations for light-weight CPU accounting and control in the Java virtual machine
This article constitutes a thorough presentation of an original scheme for portable CPU accounting and control in Java, which is based on program transformation techniques at the ...
Jarle Hulaas, Walter Binder
PPOPP
2005
ACM
14 years 3 months ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser
CASES
2005
ACM
13 years 12 months ago
Exploring the design space of LUT-based transparent accelerators
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
Sami Yehia, Nathan Clark, Scott A. Mahlke, Kriszti...
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
14 years 4 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...