Browsing by Author "Blesa Aguilera, Maria Josep"
Now showing items 120 of 59

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)
Conference lecture
Open AccessThis work deals with an NPhard 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 (200009)
Research report
Open AccessWe present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a wellknown metaheuristic that has proved successful for suboptimally solving hard combinatorial optimization problems. ... 
A C++ Implementation of of Tabu Search for kcardinality tree problem based on generic programming and component reuse
Blesa Aguilera, Maria Josep; Xhafa Xhafa, Fatos (200009)
Research report
Open AccessWe present a C++ implementation of Tabu Search method for the Minimum kCardinality Tree problem. Tabu Search is a well known heuristic for suboptimally 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é (200201)
Research report
Open AccessIn 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 (200310)
Research report
Open AccessWe 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 repetitionfree longest common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep (201806)
Article
Open AccessThis paper deals with an NPhard string problem from the bioinformatics field: the repetitionfree longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted ... 
A costbenefit 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)
Conference report
Open AccessThe first course on programming is fundamental in the Facultat d’Informàtica de Barcelona. After a major redesign of the Programming1 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 arcpreserving common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep (Institute of Electrical and Electronics Engineers (IEEE), 2017)
Conference lecture
Open AccessThe longest arcpreserving common subsequence problem is an NPhard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of artannotated ... 
A hybrid evolutionary algorithm based on solution merging for the longest arcpreserving common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep (2017)
Research report
Open AccessThe longest arcpreserving common subsequence problem is an NPhard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of arcannotated ... 
A Memetic algorithm for the minimum weighted kcardinality tree subgraph problem
Blesa Aguilera, Maria Josep; Moscato, Pablo; Xhafa Xhafa, Fatos (200103)
Research report
Open AccessIn this paper we present a memetic algorithm for the minimum weighted kcardinality 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 (200403)
Research report
Open AccessWe study some aspects of the instability of the lastinfirstout (LIFO) scheduling protocol in underloaded packetswitched networks under the Adversarial Queueing Theory model [Borodin et al., Journal of the ACM, ... 
A protocol for selfsynchronized dutycycling 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)
Conference report
Restricted access  publisher's policyIn this work we present a protocol for selfsynchronized dutycycling 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 (200601)
Research report
Open AccessDISC is an international symposium on the theory, design, analysis, implementation and application of distributed systems and networks. The wellknown 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 (200106)
Research report
Open AccessWe present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a wellknown metaheuristic that has proved successful for suboptimally solving hard combinatorial optimization problems. Recently ... 
Adversarial models for prioritybased networks
Álvarez Faura, M. del Carme; Díaz Cort, Josep; Blesa Aguilera, Maria Josep; Fernández Anta, Antonio; Serna Iglesias, María José (200306)
Research report
Open AccessWe 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é (200505)
Research report
Open AccessIn 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, 20160705)
Conference lecture
Open AccessEste trabajo analiza cuantitativamente las diferentes medidas adoptadas en la evaluación contínua del curso de Programación1 de la Facultat d’Informàtica de Barcelona de la Universitat Politècnica de Catalunya desde 2010, ... 
Beam search for the longest common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep; López Ibañez, Manuel (200810)
Research report
Open AccessThe 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 ... 
BeamACO for the repetitionfree longest common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (2013)
Conference report
Restricted access  publisher's policyIn this paper we propose a BeamACO approach for a combinatorial optimization problem known as the repetitionfree longest common subsequence problem. Given two input sequences x and y over a finite alphabet S, this problem ... 
Can frogs find large independent sets in a decentralized way? Yes they can!
Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (Springer, 2014)
Conference report
Open AccessThe problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility ...