1396 search results - page 117 / 280 » Succinct Dynamic Data Structures |
123
click to vote
ORL
2000
15 years 1 months ago
2000
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...
115
click to vote
DAC
1999
ACM
15 years 5 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
132
click to vote
CPHYSICS
2008
15 years 1 months ago
2008
A scalable parallel algorithm has been designed to perform multimillion-atom molecular dynamics (MD) simulations, in which first principlesbased reactive force fields (ReaxFF) des...
118
click to vote
LISP
2008
15 years 1 months ago
2008
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...
113
click to vote
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
Malleability enables a parallel application’s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to...