706 search results - page 61 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
MASS
2010
13 years 5 months ago
2010
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
FOCS
1999
IEEE
14 years 9 hour ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
IJCAI
1997
13 years 9 months ago
1997
Most research in learning for planning has concentrated on efficiency gains. Another important goal is improving the quality of final plans. Learning to improve plan quality has b...
IEICET
2006
13 years 7 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...