发明授权
- 专利标题: Determining a minimum cost solution for resolving covering-by-pairs problem
- 专利标题(中): 确定解决逐对问题的最低成本解决方案
-
申请号: US12277878申请日: 2008-11-25
-
公开(公告)号: US07924729B2公开(公告)日: 2011-04-12
- 发明人: Mauricio Guilherme de Carvalho Resende
- 申请人: Mauricio Guilherme de Carvalho Resende
- 申请人地址: US GA Atlanta
- 专利权人: AT&T Intellectual Property I, L.P.
- 当前专利权人: AT&T Intellectual Property I, L.P.
- 当前专利权人地址: US GA Atlanta
- 代理机构: Hope Baldauff Hartman, LLC
- 主分类号: H04L12/28
- IPC分类号: H04L12/28
摘要:
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.
公开/授权文献
信息查询