Ara es mostren els items 1-20 de 65

    • A biased random key genetic algorithm for the weighted independent domination problem 

      Rodríguez Corominas, Guillem; Blum, Christian; Blesa Aguilera, Maria Josep (Association for Computing Machinery (ACM), 2019)
      Comunicació de congrés
      Accés obert
      This work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed ...
    • A C++ implementation of a skeleton for Tabu Search method 

      Blesa Aguilera, Maria Josep; Xhafa Xhafa, Fatos (2000-09)
      Report de recerca
      Accés obert
      We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-known meta-heuristic that has proved successful for sub-optimally solving hard combinatorial optimization problems. ...
    • A C++ Implementation of of Tabu Search for k-cardinality tree problem based on generic programming and component reuse 

      Blesa Aguilera, Maria Josep; Xhafa Xhafa, Fatos (2000-09)
      Report de recerca
      Accés obert
      We present a C++ implementation of Tabu Search method for the Minimum k-Cardinality Tree problem. Tabu Search is a well known heuristic for sub-optimally solving optimization problems. This method applies also to Minimum ...
    • A Characterization of universal stability for directed graphs in the adversarial queueing model 

      Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Serna Iglesias, María José (2002-01)
      Report de recerca
      Accés obert
      In this paper we provide a characterization of universal stability for digraphs in the general case that the packets are not restricted to follow simple paths. Furthermore, we consider a variation of the Nearest To Go ...
    • A Characterization of universal stability in the adversarial queuing model 

      Serna Iglesias, María José; Blesa Aguilera, Maria Josep; Álvarez Faura, M. del Carme (2003-10)
      Report de recerca
      Accés obert
      We study universal stability of directed and undirected graphs in the adversarial queueing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before ...
    • A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2018-06)
      Article
      Accés obert
      This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted ...
    • A cost-benefit analysis of continuous assessment 

      Duch Brown, Amalia; Gabarró Vallès, Joaquim; Petit Silvestre, Jordi; Blesa Aguilera, Maria Josep; Serna Iglesias, María José (SciTePress, 2015)
      Text en actes de congrés
      Accés obert
      The first course on programming is fundamental in the Facultat d’Informàtica de Barcelona. After a major redesign of the Programming-1 course in 2006 to give it a more practical flavor, an increasing number of measures ...
    • A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (Institute of Electrical and Electronics Engineers (IEEE), 2017)
      Comunicació de congrés
      Accés obert
      The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ...
    • A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2017)
      Report de recerca
      Accés obert
      The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of arc-annotated ...
    • A Memetic algorithm for the minimum weighted k-cardinality tree subgraph problem 

      Blesa Aguilera, Maria Josep; Moscato, Pablo; Xhafa Xhafa, Fatos (2001-03)
      Report de recerca
      Accés obert
      In this paper we present a memetic algorithm for the minimum weighted k-cardinality tree subgraph problem. This problem consists in finding, in a given undirected weighted graph G=(V,E,W), a tree T of k edges having minimal ...
    • A Note on the use of topology extensions for provoking instability in communication networks 

      Blesa Aguilera, Maria Josep (2004-03)
      Report de recerca
      Accés obert
      We study some aspects of the instability of the last-in-first-out (LIFO) scheduling protocol in under-loaded packet-switched networks under the Adversarial Queueing Theory model [Borodin et al., Journal of the ACM, ...
    • A protocol for self-synchronized duty-cycling in sensor networks: Generic implementation in Wiselib 

      Hernández Pibernat, Hugo; Baumgartner, Tobias; Blesa Aguilera, Maria Josep; Blum, Christian; Kröller, Alexander; Fekete, Sandor P. (IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      In this work we present a protocol for self-synchronized duty-cycling in wireless sensor networks with energy harvesting capabilities. The protocol is implemented in Wiselib, a library of generic algorithms for sensor ...
    • A review on DISC 2005, the 19th International Symposium on Distributed Computing 

      Blesa Aguilera, Maria Josep; Georgiou, Chryssis (2006-01)
      Report de recerca
      Accés obert
      DISC is an international symposium on the theory, design, analysis, implementation and application of distributed systems and networks. The well-known International Symposium on Distributed Computing is organized annually ...
    • A skeleton for the Tabu search metaheuristic with applications to problems in software engineering 

      Blesa Aguilera, Maria Josep; Xhafa Xhafa, Fatos (2001-06)
      Report de recerca
      Accés obert
      We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-known meta-heuristic that has proved successful for sub-optimally solving hard combinatorial optimization problems. Recently ...
    • Adversarial models for priority-based networks 

      Álvarez Faura, M. del Carme; Díaz Cort, Josep; Blesa Aguilera, Maria Josep; Fernández Anta, Antonio; Serna Iglesias, María José (2003-06)
      Report de recerca
      Accés obert
      We propose several variations of the adversarial queueing model. The priority model takes into account the case in which the packets can have different priorities, assigned by the adversary at injection time. The ...
    • Adversarial queueing model for continuous network dynamics 

      Blesa Aguilera, Maria Josep; Calzada, Daniel; Fernández Anta, Antonio; López, Luís; Martínez Fernández, Andrés; Santos, Agustín; Serna Iglesias, María José (2005-05)
      Report de recerca
      Accés obert
      In this paper we start the study of generalizing the Adversarial Queueing Theory (AQT) model towards a continuous scenario in which the usually assumed synchronicity of the evolution is not required anymore. We consider a ...
    • Análisis de la evolución de un curso: productividad y desigualdad 

      Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Petit Silvestre, Jordi; Serna Iglesias, María José (Universidad de Almería, 2016-07-05)
      Comunicació de congrés
      Accés obert
      Este trabajo analiza cuantitativamente las diferentes medidas adoptadas en la evaluación contínua del curso de Programación-1 de la Facultat d’Informàtica de Barcelona de la Universitat Politècnica de Catalunya desde 2010, ...
    • AntNetAlign: A software package for network alignment 

      Rodríguez i Corominas, Guillem; Blesa Aguilera, Maria Josep; Blum, Christian (Elsevier, 2023-03)
      Article
      Accés obert
      In this paper we introduce AntNetAlign, an open-source tool (written in C++) that implements an Ant Colony Optimization (ACO) for solving the Network Alignment (NA) problem, a well-known hard optimization problem with ...
    • AntNetAlign: Ant colony optimization for network alignment 

      Rodríguez Corominas, Guillem; Blesa Aguilera, Maria Josep; Blum, Christian (2023-01)
      Article
      Accés obert
      Network Alignment (NA) is a hard optimization problem with important applications such as, for example, the identification of orthologous relationships between different proteins and of phylogenetic relationships between ...
    • Beam search for the longest common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep; López Ibañez, Manuel (2008-10)
      Report de recerca
      Accés obert
      The longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational ...