Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Claudia Snels"'
Publikováno v:
International Journal of Sustainable Energy Planning and Management, Vol 24 (2019)
Currently, one of Italy’s major institutional challenges in the field of integrated sustainability is to further develop the local governance capacities in order to facilitate the energy transition; this aspect, which, up to now, had to answer for
Externí odkaz:
https://doaj.org/article/2ad6e659025846d891b001f4729e53e0
Publikováno v:
International Journal of Advanced Robotic Systems, Vol 12 (2015)
This paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs) and describes the verification process of the derived algorithm results by means of two simulation tools realized b
Externí odkaz:
https://doaj.org/article/6d08aa2a7c0d4490866692b2a03acebc
Publikováno v:
International Journal of Advanced Robotic Systems, Vol 12 (2015)
International Journal of Advanced Robotic Systems
International Journal of Advanced Robotic Systems
This paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs) and describes the verification process of the derived algorithm results by means of two simulation tools realized b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24965f0863940df0137e836f803fb129
https://doaj.org/article/6d08aa2a7c0d4490866692b2a03acebc
https://doaj.org/article/6d08aa2a7c0d4490866692b2a03acebc
Publikováno v:
IPCO
IPCO, springer, 2013
Integer Programming and Combinatorial Optimization ISBN: 9783642366932
IPCO, springer, 2013
Integer Programming and Combinatorial Optimization ISBN: 9783642366932
We give new algorithms for the minimum (weighted) clique cover in a claw-free perfect graph G, improving the complexity from O(|V(G)|5) to O(|V(G)|3). The new algorithms build upon neat reformulations of the problem: it basically reduces either to so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19ca0e3cda250913465197f7af5d0f69
https://hal.inria.fr/hal-00948241
https://hal.inria.fr/hal-00948241
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783642346101
WG
WG
The only available combinatorial algorithm for the minimum weighted clique cover (mwcc) in claw-free perfect graphs is due to Hsu and Nemhauser [10] and dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a4727767792ca261a6ed521dad95263
https://doi.org/10.1007/978-3-642-34611-8_6
https://doi.org/10.1007/978-3-642-34611-8_6
Autor:
Paola Iovanna, A. Germoni, Marzio Puleri, Francesco Di Michele, Gianpaolo Oriolo, Giulio Bottari, Claudia Snels
Publikováno v:
Optical Fiber Communication Conference/National Fiber Optic Engineers Conference 2011.
A multi-layer grooming and routing method, which considers the optical layer constraints, is proposed. This method, based on a new modeling, allows significant resource saving with respect to a layer by layer approach.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a917f76a04c092f0e16bfb52b2b6abb9
https://doi.org/10.1364/nfoec.2011.jwa059
https://doi.org/10.1364/nfoec.2011.jwa059