706 search results - page 48 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ICCAD
2000
IEEE
14 years 2 days ago
2000
IEEE
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that ...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
CCS
2007
ACM
13 years 11 months ago
2007
ACM
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
JPDC
2006
13 years 7 months ago
2006
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...