1760 search results - page 99 / 352 » Connected Set Cover Problem and Its Applications |
206
click to vote
CPAIOR
2011
Springer
14 years 9 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...
168
Voted
INFOCOM
1998
IEEE
15 years 10 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...
199
click to vote
CORR
2011
Springer
15 years 1 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...
173
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
156
click to vote
COR
2010
15 years 6 months ago
2010
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...