1272 search results - page 113 / 255 » The Set Cover with Pairs Problem |
149
Voted
INFOCOM
1998
IEEE
15 years 9 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...
172
click to vote
CORR
2011
Springer
15 years 2 days 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...
157
click to vote
NETWORKS
2011
15 years 13 hour 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...
183
Voted
CPAIOR
2011
Springer
14 years 8 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...
147
click to vote
ICIP
2005
IEEE
16 years 6 months ago
2005
IEEE
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...