S.D. Nikolopoulos and G. Samaras, "Sob-optimal Approach to Track Detection for Real-time Systems", 21st Euromicro Conference on Design of Hardware and Software Systems, IEEE/CS, Como, Italy, pp. 98-107, Sept. 4-7, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Addressing Network Survivability Issues by Finding.. - Nikolopoulos.. (1977) (1 citation) Self-citation (Nikolopoulos) (Correct)
No context found.
S.D. Nikolopoulos and G. Samaras, "Sob-optimal Approach to Track Detection for Real-time Systems", 21st Euromicro Conference on Design of Hardware and Software Systems, IEEE/CS, Como, Italy, pp. 98-107, Sept. 4-7, 1995.
Addressing Network Survivability Issues by Finding - The Best Paths (1997) Self-citation (Nikolopoulos) (Correct)
....spans. In this paper, we formulate the network survivability problem in terms of a number of transformations leading to a trellis graph. A trellis graph is a structured graph offering several advantages in formulating many problems of diverse fields such as radar, sonar, radioasronomy, etc. [8, 9, 10, 11]. Using the trellis graph we seek to find the K best disjoint paths from an origin node to a destination node. If there is a cutpoint (or articulation point) then there are no disjoint paths [12] Therefore we seek the next best solution (not necessarily optimal) that is a solution which ....
....in the shortest path, no links connecting to t remain, therefore the algorithm terminates with only one path found) Remark: after step 1, we can easily check whether any disjoint paths for an OD pair exist. The process is fairly straight forward; it merely checks whether there is a cutpoint [11, 12]. If there are no disjoint paths, then we must find the K best paths which are as diverse as the network topology allows (i.e. minimize any sharing of resources between the paths) Toward this end our initial thoughts follow: Break up the trellis graph at the cutpoint to form two trellis ....
S.D. Nikolopoulos and G. Samaras, "Sob-optimal Approach to Track Detection for Real-time Systems", 21st Euromicro Conference on Design of Hardware and Software Systems, IEEE/CS, Como, Italy, pp. 98107, Sept. 4-7, 1995.
Addressing Network Survivability Issues by Finding.. - Nikolopoulos.. (1997) (1 citation) Self-citation (Nikolopoulos) (Correct)
....common spans. In this paper, we formulate the network survivability problem in terms of a number of transformations leading to a trellis graph. A trellis graph is a structured graph offering several advantages in formulating many problems of diverse fields such as radar, sonar, radioasronomy, etc. [8, 9, 10, 11]. Using the trellis graph we seek to find the K best disjoint paths from an origin node to a destination node. If there is a cutpoint (or articulation point) then there are no disjoint paths [12] Therefore we seek the next best solution (not necessarily optimal) that is a solution which ....
....in the shortest path, no links connecting to t remain, therefore the algorithm terminates with only one path found) Remark: after step 1, we can easily check whether any disjoint paths for an OD pair exist. The process is fairly straight forward; it merely checks whether there is a cutpoint [11, 12]. If there are no disjoint paths, then we must find the K best paths which are as diverse as the network topology allows (i.e. minimize any sharing of resources between the paths) Toward this end our initial thoughts follow: Break up the trellis graph at the cutpoint to form two trellis ....
S.D. Nikolopoulos and G. Samaras, "Sob-optimal Approach to Track Detection for Real-time Systems", 21st Euromicro Conference on Design of Hardware and Software Systems, IEEE/CS, Como, Italy, pp. 98107, Sept. 4-7, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC