Sciweavers

1702 search results - page 140 / 341
» Doomed program points
Sort
View
ICALP
1992
Springer
15 years 9 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
149
Voted
ICALP
2007
Springer
15 years 9 months ago
Online Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...
146
Voted
FORMATS
2006
Springer
15 years 8 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
PACS
2000
Springer
99views Hardware» more  PACS 2000»
15 years 8 months ago
Dynamically Reconfiguring Processor Resources to Reduce Power Consumption in High-Performance Processors
Power dissipation is a major concern not only for portable systems, but also for high-performance systems. In the past, energy consumption and processor heating was reduced mainly...
Roberto Maro, Yu Bai, R. Iris Bahar
239
Voted
POPL
2009
ACM
16 years 5 months ago
Equality saturation: a new approach to optimization
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed t...
Ross Tate, Michael Stepp, Zachary Tatlock, Sorin L...