820 search results - page 135 / 164 » Finding low-utility data structures |
FMSD
2006
13 years 8 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
ISCA
2008
IEEE
13 years 8 months ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
IVC
2008
13 years 8 months ago
2008
Groupwise non-rigid registration aims to find a dense correspondence across a set of images, so that analogous structures in the images are aligned. For purely automatic inter-sub...
LISP
2008
13 years 8 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...
TKDE
2008
13 years 8 months ago
2008
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...