895 search results - page 129 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
117
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
INFOCOM
1998
IEEE
15 years 3 months ago
1998
IEEE
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
NETWORKS
2011
14 years 5 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
107
Voted
CPAIOR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
PODC
2005
ACM
15 years 4 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...