Determining a minimum cost solution for resolving...

Details Determining a minimum cost solution for resolving... Determining a minimum cost solution for resolving...

2011-04-12

2011-04-12

Yao, Kwang B (Department: 2473)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S255000, C709S223000, C709S241000

Reexamination Certificate

active

07924729

ABSTRACT:
In one method for determining a minimum cost solution for resolving a covering-by-pairs problem, a plurality of covering nodes, a plurality of branch nodes, and a plurality of edges connecting the covering nodes and the branch nodes are given. A plurality of vectors are generated. For each vector in the plurality of vectors, it is determined whether the selected covering nodes cover the branch nodes. Responsive to determining that the selected covering nodes do not cover the branch nodes, each vector is completed so that the selected covering nodes cover the branch nodes. Responsive to determining that selected covering nodes cover the branch nodes or to completing the vector, redundant covering nodes are removed from each vector. The vectors are inserted into a current population. A new population is generated by evolving the current population for at least one generation.

REFERENCES:
patent: 5777948 (1998-07-01), Ferkinhoff et al.
patent: 7075892 (2006-07-01), Grover et al.
patent: 7464147 (2008-12-01), Fakhouri et al.
patent: 7599385 (2009-10-01), Andrade et al.
patent: 7610367 (2009-10-01), Canright et al.
patent: 2004/0111502 (2004-06-01), Oates
patent: 2004/0260813 (2004-12-01), Heisserman et al.
Research Paper entitled “Algorithms for Node Placement in Path-Disjoint Network Monitoring,” presented at The AIRO 2008: XXXIX Annual Conference of the Italian Operational Research Society in Ischia, Italy, Sep. 8-11, 2008; Inventor: Mauricio G. C. Resende, 134 pages.
Research Paper entitled “A Random-Keys Genetic Algorithm for Node Placement in Path-Disjoint Network Monitoring,” presented at The Sensors 2008: Theory, Algorithms, and Applications Research and Engineering Education Facility (REEF) University of Florida, Shalimar, Florida, Apr. 24-26, 2008; Inventor: Mauricio G. C. Resende, 90 pages.
Research Paper entitled “A Genetic Algorithm With Random-Keys for Node Placement in Path-Disjoint Network Monitoring,” presented at The DIMACS/DyDAn Workshop on Internet Tomography, DIMACS˜Rutgers University, May 14-16, 2008; Inventor: Mauricio G. C. Resende, 73 pages.

Affiliated with

Also associated with

Rating

Determining a minimum cost solution for resolving... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Determining a minimum cost solution for resolving..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining a minimum cost solution for resolving... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2660234