2796 search results - page 44 / 560 » The coolest path problem |
115
click to vote
ILP
2007
Springer
15 years 6 months ago
2007
Springer
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
104
click to vote
MSN
2007
Springer
15 years 6 months ago
2007
Springer
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
WORDS
2002
IEEE
15 years 4 months ago
2002
IEEE
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
142
click to vote
ECCC
2007
14 years 11 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...