Sciweavers

16844 search results - page 3095 / 3369
» How to Design Programs
Sort
View
ISSTA
2000
ACM
15 years 11 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 11 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
15 years 11 months ago
CRUSADE: Hardware/Software Co-Synthesis of Dynamically Reconfigurable Heterogeneous Real-Time Distributed Embedded Systems
Dynamically reconfigurable embedded systems offer potential for higher performance as well as adaptability to changing system requirements at low cost. Such systems employ run-tim...
Bharat P. Dav
PODC
1999
ACM
15 years 11 months ago
Dynamically Configurable Distributed Objects
The dynamically configurable distributed object (DCDO) model helps enable object evolution and facilitate the development of distributed objects from multiple independent implemen...
Michael J. Lewis, Andrew S. Grimshaw
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 11 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
« Prev « First page 3095 / 3369 Last » Next »