5015 search results - page 608 / 1003 » Model Checking a Path |
184
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
182
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
199
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission...
148
click to vote
CPC
2002
15 years 6 months ago
2002
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
189
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
One challenge in delay tolerant networks (DTNs) is efficient routing, as the lack of contemporaneous end-to-end paths makes conventional routing schemes inapplicable. Many existing...