Sciweavers

1392 search results - page 90 / 279
» Staging generic programming
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
PLDI
1997
ACM
14 years 1 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
Tim A. Wagner, Susan L. Graham
SIGSOFT
2010
ACM
13 years 7 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 2 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
ECLIPSE
2004
ACM
14 years 2 months ago
MEProf: modular extensible profiling for Eclipse
This paper presents a profiling plug-in for IBM’s Eclipse development environment. Our approach characterises profiling as an interactive exploration of a large virtual database...
Marc Hull, Olav Beckmann, Paul H. J. Kelly