706 search results - page 78 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ICRA
1999
IEEE
14 years 1 months ago
1999
IEEE
In future planetary exploration missions, rovers will be required to autonomously traverse challenging environments. Much of the previous work in robot motion planning cannot be s...
CAV
2004
Springer
14 years 19 days ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
CPM
1998
Springer
14 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
TPDS
2008
13 years 8 months ago
2008
High Performance Computing data centers have been rapidly growing, both in number and size. Thermal management of data centers can address dominant problems associated with cooling...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...