434 search results - page 26 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
ASPDAC
2006
ACM
15 years 1 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...
FOCS
1993
IEEE
15 years 1 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
SODA
2000
ACM
14 years 10 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
ICNP
2003
IEEE
15 years 2 months ago
2003
IEEE
TCP Slow Start exponentially increases the congestion window size to detect the proper congestion window for a network path. This often results in significant packet loss, while ...
ICCSA
2004
Springer
15 years 2 months ago
2004
Springer
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...