发明名称 Determining a minimum cost solution for resolving covering-by-pairs problem
摘要 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.
申请公布号 US7924729(B2) 申请公布日期 2011.04.12
申请号 US20080277878 申请日期 2008.11.25
申请人 AT&T INTELLECTUAL PROPERTY I, L.P. 发明人 RESENDE MAURICIO GUILHERME DE CARVALHO
分类号 H04L12/28 主分类号 H04L12/28
代理机构 代理人
主权项
地址