Maria J. Blesa
According to our database1, Maria J. Blesa
Legend:Book In proceedings Article PhD thesis Other
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.
Appl. Soft Comput., 2018
Large neighborhood search for the most strings with few bad columns problem.
Soft Comput., 2017
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem.
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017
Theor. Comput. Sci., 2016
Firefighting as a Strategic Game.
Internet Mathematics, 2016
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs.
Swarm Intelligence, 2015
Stars and Celebrities: A Network Creation Game.
On solving the most strings with few bad columns problem: An ILP model and heuristics.
Proceedings of the International Symposium on Innovations in Intelligent SysTems and Applications, 2015
A Cost-benefit Analysis of Continuous Assessment.
Proceedings of the CSEDU 2015, 2015
Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio.
Proceedings of the Computer Supported Education - 7th International Conference, 2015
Firefighting as a Game.
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014
The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014
The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android.
Proceedings of the CSEDU 2014, 2014
Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!
Proceedings of the Swarm Intelligence - 9th International Conference, 2014
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem.
Proceedings of the Artificial Evolution, 2013
The robustness of stability under link and node failures.
Theor. Comput. Sci., 2011
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones.
Bulletin of the EATCS, 2011
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010
Topology control algorithms in WISELIB.
Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications, 2010
Adversarial Queueing Model for Continuous Network Dynamics.
Theory Comput. Syst., 2009
Beam search for the longest common subsequence problem.
Computers & OR, 2009
An ant colony optimization algorithm for DNA sequencing by hybridization.
Computers & OR, 2008
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm.
J. Math. Model. Algorithms, 2007
Probabilistic Beam Search for the Longest Common Subsequence Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Efficient parallel LAN/WAN algorithms for optimization. The mallba project.
Parallel Computing, 2006
A Report from DISC 2005, the 19th International Symposium on Distributed Computing.
Bulletin of the EATCS, 2006
Generic parallel implementations for Tabu search.
Comput. Syst. Sci. Eng., 2006
A nature-inspired algorithm for the disjoint paths problem.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006
Adversarial models for priority-based networks.
New metaheuristic approaches for the edge-weighted k-cardinality tree problem.
Computers & OR, 2005
Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time , .
Proceedings of the Distributed Computing, 19th International Conference, 2005
Adversarial Queueing Model for Continuous Network Dynamics.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem.
Proceedings of the Computational Intelligence and Bioinspired Systems, 2005
A Characterization of Universal Stability in the Adversarial Queuing Model.
SIAM J. Comput., 2004
The complexity of deciding stability under FFS in the Adversarial Queueing model.
Inf. Process. Lett., 2004
The Impact of Failure Management on the Stability of Communication Networks.
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004
Using Parallelism in Experimenting and Fine Tuning of Parameters for Metaheuristics.
Proceedings of the Computational Science, 2004
Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem.
Proceedings of the Applications of Evolutionary Computing, 2004
Adversarial Models for Priority-Based Networks.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Universal stability of undirected graphs in the adversarial queueing model.
MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note).
Proceedings of the Euro-Par 2002, 2002
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition.
Proceedings of the Parallel Processing and Applied Mathematics, 2001
Parallel Skeletons for Tabu Search Method.
Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001