763 search results - page 93 / 153 » Engineering Shortest Path Algorithms |
90
Voted
ISCAS
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
155
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
121
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
218
Voted
ISSTA
2004
ACM
15 years 7 months ago
2004
ACM
We show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. We focus on ...
119
Voted
WCET
2010
15 years 2 days ago
2010
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...