Sciweavers

1452 search results - page 43 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
IPPS
2003
IEEE
14 years 3 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
CP
2007
Springer
14 years 4 months ago
: The Design and Analysis of an Algorithm Portfolio for SAT
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
PLDI
2011
ACM
13 years 23 days ago
Precise and compact modular procedure summaries for heap manipulating programs
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
Isil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagi...
PE
2010
Springer
144views Optimization» more  PE 2010»
13 years 4 months ago
A unified framework for the bottleneck analysis of multiclass queueing networks
We introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks in the limiting regime where the number of jobs proportionally grows t...
Jonatha Anselmi, Paolo Cremonesi