Sciweavers

3376 search results - page 501 / 676
» Analyzing Software Evolvability
Sort
View
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
16 years 23 days ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
GRID
2007
Springer
16 years 22 days ago
Log summarization and anomaly detection for troubleshooting distributed systems
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...
Dan Gunter, Brian Tierney, Aaron Brown, D. Martin ...
LCPC
2007
Springer
16 years 21 days ago
Using ZBDDs in Points-to Analysis
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...
Ondrej Lhoták, Stephen Curial, José ...
CODES
2006
IEEE
16 years 19 days ago
Yield prediction for architecture exploration in nanometer technology nodes: : a model and case study for memory organizations
Process variability has a detrimental impact on the performance of memories and other system components, which can lead to parametric yield loss at the system level due to timing ...
Antonis Papanikolaou, T. Grabner, Miguel Miranda, ...
COMPSAC
2006
IEEE
16 years 19 days ago
Performance Analysis of an Asynchronous Web Server
Modern Web servers need to process multiple requests concurrently in order to fulfill the workload demands expected of them. Concurrency can be implemented in a Web server using ...
U. Praphamontripong, Swapna S. Gokhale, Aniruddha ...