Sciweavers

548 search results - page 6 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
PLDI
2010
ACM
14 years 2 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
PLDI
2012
ACM
12 years 7 days ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
PEPM
2004
ACM
14 years 3 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
13 years 7 months ago
Dynamic path planning with multi-agent data fusion - The Parallel Hierarchical Replanner
The design of a hierarchical planning system in which each level operates in parallel and communicates asynchronously is presented. It is shown that this Parallel Hierarchical Repl...
Thomas Allen, Andrew Hill, James Patrick Underwood...
CIBCB
2008
IEEE
14 years 4 months ago
Temporal and structural analysis of biological networks in combination with microarray data
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...
Chang Hun You, Lawrence B. Holder, Diane J. Cook