206 search results - page 2 / 42 » Three Hoppy path problems and ternary paths |
ISCAS
2005
IEEE
13 years 10 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...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
CDC
2009
IEEE
13 years 3 months ago
2009
IEEE
This paper is devoted to path following control for port-Hamiltonian systems whose desired path is timevarying. Most of the existing results on path following can only take care of...
ISPAN
2005
IEEE
13 years 10 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...