Sciweavers

336 search results - page 45 / 68
» Program Speedups in Theory and Practice
Sort
View
ICFP
2005
ACM
16 years 14 days ago
Continuations from generalized stack inspection
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
Greg Pettyjohn, John Clements, Joe Marshall, Shrir...
ERSHOV
1989
Springer
15 years 4 months ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
122
Voted
HICSS
2008
IEEE
135views Biometrics» more  HICSS 2008»
15 years 20 days ago
From Adoption to Diffusion of a Telehealth Innovation
Telehealth innovations promise to provide extensive medical benefits by increasing access to healthcare services and lowering costs at the same time. However, while many telehealt...
Sunyoung Cho, Lars Mathiassen, Michael Gallivan
82
Voted
DAC
2009
ACM
16 years 1 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 7 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert