Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Andrea Raiconi"'
Publikováno v:
Bioinformatics. 39
Motivation Binary (or Boolean) matrices provide a common effective data representation adopted in several domains of computational biology, especially for investigating cancer and other human diseases. For instance, they are used to summarize genetic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6a7d2f70266d81243f33b2cd03479aa
https://doi.org/10.1093/bioinformatics/btad016
https://doi.org/10.1093/bioinformatics/btad016
Autor:
Vincenzo Auletta, Daniele Anello, Raffaele Cerulli, Marco Amoruso, Diodato Ferraioli, Andrea Raiconi
Publikováno v:
Journal of Artificial Intelligence Research. 69:847-879
Online social networks are nowadays one of the most effective and widespread tools used to share information. In addition to being employed by individuals for communicating with friends and acquaintances, and by brands for marketing and customer serv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::002782cfa470ffe7cacc9387de5023c4
https://doi.org/10.1613/jair.1.11509
https://doi.org/10.1613/jair.1.11509
Autor:
Ciriaco D’Ambrosio, Luigi Pavone, Giovanni Capobianco, Gaetano Vitale, Andrea Raiconi, Fabio Sebastiano
In this paper, we present a novel hybrid metaheuristic for the Knapsack Problem with Forfeits (KPF). KPF is a recently introduced generalization of the Knapsack Problem. In this variant, a penalty cost incurs whenever both items composing a so-called
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::651525353f44e4168f6ddcf8102a865f
https://hdl.handle.net/11695/113028
https://hdl.handle.net/11695/113028
Publikováno v:
Computers & Operations Research. 151:106093
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58ca1772243d63197e1e249bc19074ee
https://doi.org/10.1016/j.cor.2022.106093
https://doi.org/10.1016/j.cor.2022.106093
The All-Colors Shortest Path (ACSP) is a recently introduced NP-Hard optimization problem, in which a color is assigned to each vertex of an edge weighted graph, and the aim is to find the shortest path spanning all colors. The solution path can be n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cbb03b7fcd6052b00791e08a6467f9c
http://hdl.handle.net/11386/4751124
http://hdl.handle.net/11386/4751124
The maximum network lifetime is a well known and studied optimization problem. The aim is to appropriately schedule the activation intervals of the individual sensing devices composing a wireless sensor network used for monitoring purposes, in order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::506ffe0db7e141e2ce9e58d57e674b67
http://hdl.handle.net/11386/4733585
http://hdl.handle.net/11386/4733585
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030532611
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b27baa5ff51f2297c418dbc57ef9e91
https://doi.org/10.1007/978-3-030-53262-8_25
https://doi.org/10.1007/978-3-030-53262-8_25
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
ISCO
In this paper we introduce and study the Knapsack Problem with Forfeits. With respect to the classical definition of the problem, we are given a collection of pairs of items, such that the inclusion of both in the solution involves a reduction of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::828cb0129700a9658f0305dcbd79b863
http://hdl.handle.net/11386/4752934
http://hdl.handle.net/11386/4752934
Given an undirected weighted graph, in which each vertex is assigned to a color and one of them is identified as source, in the all-colors shortest path problem we look for a minimum cost shortest path that starts from the source and spans all differ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d1c373d387e20450a3ff6537d5ed812
http://hdl.handle.net/11386/4713408
http://hdl.handle.net/11386/4713408