Sciweavers

1392 search results - page 87 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
ORL
2000
77views more  ORL 2000»
14 years 9 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
LISP
2008
96views more  LISP 2008»
14 years 9 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
CAV
2007
Springer
104views Hardware» more  CAV 2007»
15 years 4 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
BMCBI
2007
94views more  BMCBI 2007»
14 years 9 months ago
A structural analysis of in vitro catalytic activities of hammerhead ribozymes
Background: Ribozymes are small catalytic RNAs that possess the dual functions of sequencespecific RNA recognition and site-specific cleavage. Trans-cleaving ribozymes can inhibit...
Yu Shao, Susan Wu, Chi Yu Chan, Jessie R. Klapper,...
CPHYSICS
2006
124views more  CPHYSICS 2006»
14 years 9 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...