Sciweavers

1485 search results - page 248 / 297
» Whole Program Paths
Sort
View
CC
2009
Springer
190views System Software» more  CC 2009»
14 years 8 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...
ICALP
2009
Springer
14 years 8 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 5 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
14 years 4 months ago
Simultaneous Scheduling, Binding and Layer Assignment for Synthesis of Vertically Integrated 3D Systems
Three dimensional vertically integrated systems allow active devices to be placed on multiple device layers. In recent years, a number of research efforts have addressed physical ...
Madhubanti Mukherjee, Ranga Vemuri
CHI
2010
ACM
14 years 2 months ago
Reactive information foraging for evolving goals
Information foraging models have predicted the navigation paths of people browsing the web and (more recently) of programmers while debugging, but these models do not explicitly m...
Joseph Lawrance, Margaret M. Burnett, Rachel K. E....