3678 search results - page 513 / 736 » On the Stable Paths Problem |
137
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In deep submicron technology, wire delay is no longer negligible and is gradually dominating the system latency. Some state-of-the-art architectural synthesis flows adopt the distr...
140
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
137
Voted
FITRAMEN
2008
15 years 6 months ago
2008
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
153
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
132
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...