706 search results - page 73 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
KAIS
2006
13 years 7 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
JPDC
2006
13 years 7 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
VLDB
2009
ACM
14 years 8 months ago
2009
ACM
Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broad...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...