2796 search results - page 22 / 560 » The coolest path problem |
75
Voted
COCO
2007
Springer
15 years 3 months ago
2007
Springer
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
116
Voted
ICST
2009
IEEE
15 years 6 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
115
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...