Export 458 results:
Autor Título Tipo [ Año(Asc)]
Filtros: First Letter Of Last Name is B  [Clear All Filters]
2019
Bouamama S, Blum C, Fages J-G.  2019.  An Algorithm Based on Ant Colony Optimization for the Minimum Connected Dominating Set Problem. Applied Soft Computing. 80:672-686.
Bouamama S, Blum C, Fages J-G.  2019.  An Algorithm Based on Ant Colony Optimization for the Minimum Connected Dominating Set Problem. Applied Soft Computing. 80:672-686.
Davidson PPinacho, Bouamama S, Blum C.  2019.  Application of CMSA to the Minimum Capacitated Dominating Set Problem. Genetic and Evolutionary Computation Conference (GECCO 2019). :321-328.
Davidson PPinacho, Bouamama S, Blum C.  2019.  Application of CMSA to the Minimum Capacitated Dominating Set Problem. Genetic and Evolutionary Computation Conference (GECCO 2019). :321-328.
Corominas GRódriguez, Blum C, Blesa MJ.  2019.  A Biased Random Key Genetic Algorithm for the Weighted Independent Domination Problem. Student Workshop of the Genetic and Evolutionary Computation Conference (GECCO 2019).
Corominas GRódriguez, Blum C, Blesa MJ.  2019.  A Biased Random Key Genetic Algorithm for the Weighted Independent Domination Problem. Student Workshop of the Genetic and Evolutionary Computation Conference (GECCO 2019).
de Jonge D, Baarslag T, Aydoğan R, Jonker C, Fujita K, Ito T.  2019.  The Challenge of Negotiation in the Game of Diplomacy. Agreement Technologies 2018, Revised Selected Papers. :100–114.
Blum C, Santos HGambini.  2019.  Generic CP-Supported CMSA for Binary Integer Linear Programs. International Workshop on Hybrid Metaheuristics (HM 2019). LNCS 11299:1-15.
Blesa MJ, Blum C, Santos HGambini, Davidson PPinacho, del Campo JGodoy.  2019.  HM 2019 - Proceedings of the 11th International Workshop on Hybrid Metaheuristics. LNCS 11299
Blesa MJ, Blum C, Santos HGambini, Davidson PPinacho, del Campo JGodoy.  2019.  HM 2019 - Proceedings of the 11th International Workshop on Hybrid Metaheuristics. LNCS 11299
Thiruvady D, Blum C, Ernst AT.  2019.  Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. International Workshop on Hybrid Metaheuristics (HM 2019). LNCS 11299:16-30.
Raidl GR, Puchinger J, Blum C.  2019.  Metaheuristic Hybrids. Handbook of Metaheuristics. :385–417.
Arora D, Maini P, Blum C, Davidson PPinacho.  2019.  Route Planning for Cooperative Air-Ground Robots with Fuel Constraints: An Approach based on CMSA. Genetic and Evolutionary Computation Conference (GECCO 2019). :207-214.
2018
Bou F, Plaza E, Schorlemmer M.  2018.  Amalgams, colimits, and conceptual blending. Concept Invention: Foundations, Implementation, Social Aspects and Applications.
Pérez A, Blum C, Lozano JAntonio.  2018.  Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models. The 9th International Conference on Probabilistic Graphical Models. 72:320-331.
Cebrián S, Morera N, Barceló JAnton, Bogdanovic I, López-Bultó O, Campana I, Palomo A, Piqué R, Revelles J, Terradas X et al..  2018.  Beyond the Virtual Reconstruction of an Archaeological Settlement. Computer Applications and Quantitative Methods in Archaeology (CAA) international conference.
Cebrián S, Morera N, Barceló JAnton, Bogdanovic I, López-Bultó O, Campana I, Palomo A, Piqué R, Revelles J, Terradas X et al..  2018.  Beyond the Virtual Reconstruction of an Archaeological Settlement. Computer Applications and Quantitative Methods in Archaeology (CAA) international conference.
Cebrián S, Morera N, Barceló JAnton, Bogdanovic I, López-Bultó O, Campana I, Palomo A, Piqué R, Revelles J, Terradas X et al..  2018.  Beyond the Virtual Reconstruction of an Archaeological Settlement. Computer Applications and Quantitative Methods in Archaeology (CAA) international conference.
Andrejczuk E, Berger R, Sierra C, Rodríguez-Aguilar JA, Marín-Puchades V.  2018.  The Composition and Formation of Effective Teams. Computer Science meets Psychology. The Knowledge Engineering Review. 33
Blum C, Blesa MJ.  2018.  A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem. Journal of Heuristics. 24(3):551-579.
Blum C, Blesa MJ.  2018.  A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem. Journal of Heuristics. 24(3):551-579.
Bistaffa F, Farinelli A.  2018.  A COP Model For Graph-Constrained Coalition Formation. Journal of Artificial Intelligence Research. 62:133-153.
Bistaffa F, Farinelli A.  2018.  A COP Model for Graph-Constrained Coalition Formation (Extended Abstract). International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018). :5553-5557.
Andrejczuk E, Bistaffa F, Blum C, Rodríguez-Aguilar JA, Sierra C.  2018.  Heterogeneous Teams for Homogeneous Performance. Proceedings of the 21st International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2018). 11224:89-105.
Andrejczuk E, Bistaffa F, Blum C, Rodríguez-Aguilar JA, Sierra C.  2018.  Heterogeneous Teams for Homogeneous Performance. Proceedings of the 21st International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2018). 11224:89-105.
Blum C, Blesa MJ.  2018.  Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem. Applied Soft Computing. 62:15-28.
Blum C, Blesa MJ.  2018.  Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem. Applied Soft Computing. 62:15-28.
Blum C.  2018.  ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition. Electronic Notes in Discrete Mathematics. 66:15-22.
Blum C, Festa P.  2018.  Selected String Problems. Handbook of Heuristics. :1221-1240.
Bistaffa F, Rodríguez-Aguilar JA, Cerquides J, Blum C.  2018.  A Simulation Tool for Large-Scale Online Ridesharing (Demonstration). International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018). :1797-1799.
Bistaffa F, Rodríguez-Aguilar JA, Cerquides J, Blum C.  2018.  A Simulation Tool for Large-Scale Online Ridesharing (Demonstration). International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018). :1797-1799.
Andrejczuk E, Bistaffa F, Blum C, Rodríguez-Aguilar JA, Sierra C.  2018.  Solving the Synergistic Team Formation Problem. Proceedings of the 17th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018). :1853-1855.
Andrejczuk E, Bistaffa F, Blum C, Rodríguez-Aguilar JA, Sierra C.  2018.  Solving the Synergistic Team Formation Problem. Proceedings of the 17th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018). :1853-1855.
Davidson PPinacho, Blum C, Lozano JAntonio.  2018.  The Weighted Independent Domination Problem: Integer Linear Programming Models and Metaheuristic Approaches. European Journal of Operational Research. 265(3):860-871.
2017
Bistaffa F, Farinelli A, Rodríguez-Aguilar JA, Cerquides J, Ramchurn SD.  2017.  Algorithms for Graph-Constrained Coalition Formation in the Real World. ACM Transactions on Intelligent Systems. 8(4):1-24.
Blum C, Blesa MJ, Duarte A, Sánchez-Oro J.  2017.  An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem. Metaheuristics International Conference (MIC). :938-940.
Blum C, Blesa MJ, Duarte A, Sánchez-Oro J.  2017.  An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem. Metaheuristics International Conference (MIC). :938-940.
Lizárraga E, Blesa MJ, Blum C.  2017.  On the comparison of CMSA versus LNS for solving Combinatorial Optimization problems with different solution sizes. Metaheuristics International Conference (MIC). :676-678.
Lizárraga E, Blesa MJ, Blum C.  2017.  On the comparison of CMSA versus LNS for solving Combinatorial Optimization problems with different solution sizes. Metaheuristics International Conference (MIC). :676-678.
Lizárraga E, Blesa MJ, Blum C.  2017.  Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? EvoCOP 2017 -- 17th European Conference on Evolutionary Computation in Combinatorial Optimization. 10197 (Lecture Notes in Computer Science):60--74.
Lizárraga E, Blesa MJ, Blum C.  2017.  Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? EvoCOP 2017 -- 17th European Conference on Evolutionary Computation in Combinatorial Optimization. 10197 (Lecture Notes in Computer Science):60--74.
Bistaffa F, Farinelli A, Chalkiadakis G, Ramchurn SD.  2017.  A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem. Artificial Intelligence. 246:86-117.
Baumgartner A, Kutsia T, Levy J, Villaret M.  2017.  Higher-Order Pattern Anti-Unification in Linear Time. Journal of Automated Reasoning. 58:293-310.
Blum C, Blesa MJ.  2017.  A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem. CEC 2017 -- Congress on Evolutionary Computation.
Blum C, Blesa MJ.  2017.  A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem. CEC 2017 -- Congress on Evolutionary Computation.