Papers by vincenzo cutello
Advances in Intelligent Systems and Computing, 2018
Lecture Notes in Computer Science, 2020
Proceedings of the 9th International Joint Conference on Computational Intelligence, 2017
An immune metaheuristic has been developed for solving the Weighted Feedback Vertex Set problem, ... more An immune metaheuristic has been developed for solving the Weighted Feedback Vertex Set problem, known to be a NP-complete problem, which finds applicability in many real-world problems. The algorithm takes inspiration by the immune system, and it is based on three main immune operators, such as cloning, hypermutation and aging. In addition to these operators a local search has been also designed with the goal to refine in deterministic way all solutions produced by the stochasticity of these operators. This local search has proved to be fruitful and effective, improving considerably both the performances of immune algorithm and its learning ability. For evaluate the robustness and efficiency of the proposed algorithm several experiments have been performed on a total of 60 graph instances of different large dimensions (from 100 to 529 vertices). Each of these instances shows different topologies; different problem dimensions; different graph density; and different weights on the ve...
Although it is well-known that a proper balancing between exploration and exploitation plays a ce... more Although it is well-known that a proper balancing between exploration and exploitation plays a central role on the performances of any evolutionary algorithm, what instead becomes crucial for both is the life time with which any offspring maturate and learn. Setting an appropriate lifespan helps the algorithm in a more efficient search as well as in fruitful exploitation of the learning discovered. Thus, in this research work we present an experimental study conducted on eleven different age assignment types, and performed on a classical genetic algorithm, with the aim to (i) understand which one provides the best performances in term of overall efficiency, and robustness; (ii) produce an efficiency ranking; and, (iii) as the most important goal, verify and prove if the tops, or most, or the whole ranking previously produced on an immune algorithm coincide with that produced for genetic algorithm. From the analysis of the achievements obtained it is possible to assert how the two ef...
In this thesis we prove the solvability of the satisfiability problem for various classes of unqu... more In this thesis we prove the solvability of the satisfiability problem for various classes of unquantified set-theoretical formulae. In particular, we will provide satisfiability tests that given a formula as input produce a model for it, if any exists. We will also show how the decidability of certain fragments of set theory can be used to prove the solvability of the satisfiability problem for some unquantified languages involving topological notions. In particular, a list of topological statements whose validity can be checked by our algorithms is given. The underlying motivation for this study is to enrich the class of theoretical results that can be used for a set-theoretic proof verifier; we also provide lower bounds for what is undecidable in set theory and topology.
Algorithms, 2020
Community detection is one of the most challenging and interesting problems in many research area... more Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interactions between biological genes, for instance. Two different immunological algorithms have been designed for this problem, called Opt-IA and Hybrid-IA, respectively. The main difference between the two algorithms is the search strategy and related immunological operators developed: the first carries out a random search together with purely stochastic operators; the last one is instead based on a deterministic Local Search that tries to refine and improve the current solutions discovered. The robustness of Opt-IA and Hybrid-IA has been assessed on several real social networks. These same networks have also been considered for comparing both algorithms with other seven different metaheuristics and the well-known greedy optimization Louvain ...
Computational Intelligence, 2019
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
Proceedings of the 2006 ACM symposium on Applied computing - SAC '06, 2006
Proceedings of the 2006 ACM symposium on Applied computing - SAC '06, 2006
Lecture Notes in Computer Science, 2006
Lecture Notes in Computer Science, 2006
Abductive Reasoning and Learning, 2000
Lecture Notes in Computer Science, 2010
Lecture Notes in Computer Science, 2011
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
Abstract In this paper, we study approximate solutions to the extension of the&qu... more Abstract In this paper, we study approximate solutions to the extension of the" maximally balanced connected partition problem", whose corresponding decision problem is known to be 𝒩 𝒫-complete. We introduce a genetic algorithm with a new crossover operator, called the" order-and distance-preserving crossover"(ODPX) operator, and we compare the results of our algorithm to a well-known deterministic approximation algorithm
Nucleic Acids Research, 2010
Uploads
Papers by vincenzo cutello