3678 search results - page 529 / 736 » On the Stable Paths Problem |
138
click to vote
CONEXT
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of improving network capacity in wireless mesh networks from the angle of multi-flow diversity. As consecutive packets on a multihop path can interfere wit...
143
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
133
click to vote
FMCAD
2008
Springer
15 years 6 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
134
click to vote
FORMATS
2008
Springer
15 years 6 months ago
2008
Springer
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...
137
click to vote
COLOGNETWENTE
2008
15 years 6 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...