706 search results - page 12 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ASPDAC
2006
ACM
13 years 11 months ago
2006
ACM
Due to false paths and multi-cycle paths in a circuit, using only topological delay to determine the clock period could be too conservative. In this paper, we address the timing a...
CONPAR
1992
13 years 11 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
GIS
2004
ACM
14 years 8 months ago
2004
ACM
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
4OR
2005
13 years 7 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...