Exploració per autor "Blum, Christian"

Ara es mostren els items 43-60 de 60

    • Large neighborhood search for the most strings with few bad columns problem 

      Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Springer, 2016-10-06)
      Article
      Accés obert
      In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings ...

    • Large neighbourhood search algorithms for the founder sequence reconstruction problem 

      Roli, Andrea; Benedettini, Stefano; Stützle, Thomas; Blum, Christian (2012-02)
      Article
      Accés restringit per política de l'editorial
      The reconstruction of founder genetic sequences of a population is a relevant issue in evolutionary biology research. The problem consists in finding a biologically plausible set of genetic sequences (founders), which can ...

    • Metaheuristics for the edge-weighted K-cardinality tree problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
      Report de recerca
      Accés obert
      Metaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the K-cardinality tree (KCT) problem in edge-weighted graphs. ...

    • Negative learning ant colony optimization for network alignment 

      Rodríguez Corominas, Guillem; Blum, Christian; Blesa Aguilera, Maria Josep (Association for Computing Machinery (ACM), 2022)
      Text en actes de congrés
      Accés obert
      The Network Alignment problem is a hard Combinatorial Optimization problem with a wide range of applications, especially in computational biology. Given two (or more) networks, the goal is to find a mapping between their ...

    • New algorithms for DNA sequencing by hybridization 

      Blum, Christian; Yábar Vallès, Mateu; Blesa Aguilera, Maria Josep (2006-12)
      Report de recerca
      Accés obert
      The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of ...

    • New constructive heuristics for DNA sequencing by hybridization 

      Blum, Christian; Yábar Vallès, Mateu (2006-05)
      Report de recerca
      Accés obert
      Deoxyribonucleic acid (DNA) is a molecule that consists of two complementary sequences of amino acids. Reading these sequences is an important task in biology, called DNA sequencing. However, large DNA molecules cannot be ...

    • On solving the assembly line worker assignment and balancing problem via beam search 

      Blum, Christian; Miralles, Cristobal (2010-01)
      Report de recerca
      Accés obert
      Certain types of manufacturing processes can be modelled by assembly line balancing problems. In this work we deal with a specific assembly line balancing problem that is know as the assembly line worker assignment and ...

    • On solving the most strings with few bad columns problem: An ILP model and heuristics 

      Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Institute of Electrical and Electronics Engineers (IEEE), 2015)
      Comunicació de congrés
      Accés obert
      The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, a ...

    • On the use of primal and dual knowledge in randomized constructive optimization algorithms 

      Mastrolilli, Monaldo; Blum, Christian (2006-12)
      Report de recerca
      Accés obert
      Many approximate heuristics for optimization are either based on neighborhood search or on the construction of solutions. Examples for the latter ones include ant colony optimization and greedy randomized adaptive search ...

    • Reconstructing geometrically consistent tree structures from noisy images 

      Türetken, Engin; Blum, Christian; González, Germán; Fua, Pascal (2010-09)
      Article
      Accés restringit per política de l'editorial
      We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bifurcation points, and impose geometric constraints ...

    • Self-synchronized duty-cycling for mobile sensor networks with energy harvesting capabilities: A swarm intelligence study 

      Hernández Pibernat, Hugo; Blum, Christian; Middendorf, Martin; Ramsch, Kai; Scheidler, Alexander (2008-11)
      Report de recerca
      Accés obert
      When asked if ants rest or if they work untiringly all day long, most people would probably respond that they had no idea. In fact, when watching the bustling life of an ant hill it is hard to imagine that ants take a rest ...

    • Self-synchronized duty-cycling for mobile sensor networks with energy harvesting capabilities: A swarm intelligence study 

      Hernández Pibernat, Hugo; Blum, Christian; Middendorf, Martin; Ramsch, Kai; Scheidler, Alexander (2009)
      Text en actes de congrés
      Accés obert
      When asked if ants rest or if they work untiringly all day long, most people would probably respond that they had no idea. In fact, when watching the bustling life of an ant hill it is hard to imagine that ants take a rest ...

    • Self-synchronized duty-cycling for sensor networks with energy harvesting capabilities: Implementation in Wiselib 

      Hernández, H.; Baumgartner, Tobias; Blum, Christian; Blesa Aguilera, Maria Josep; Fekete, Sandor P.; Kröller, Alexander (2010)
      Report de recerca
      Accés obert
      In this work we present a protocol for a self- synchronized duty-cycling mechanism in wireless sensor net- works with energy harvesting capabilities. The protocol is im- plemented in Wiselib, a library of generic algorithms ...

    • Self-synchronized duty-cycling in sensor networks with energy harvesting capabilities: the static network case 

      Hernández Pibernat, Hugo; Blum, Christian (ACM Press. Association for Computing Machinery, 2009)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Biological studies have shown that some species of ants rest quite large fractions of their time. Interestingly, not only sin- gle ants show this behaviour, but whole ant colonies exhibit synchronized activity phases ...

    • Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic 

      Baumgartner, Lukas; Schmid, Verena; Blum, Christian (2011)
      Article
      Accés restringit per política de l'editorial
      The two-dimensional bin packing problem (2BP) consists in packing a set of rectangular items into rectangular, equally-sized bins. The problem is NP-hard and has a multitude of real world applications. We consider the case ...

    • Tabu search for the founder sequence reconstruction problem: a preliminary study 

      Roli, Andrea; Blum, Christian (2009)
      Article
      Accés restringit per política de l'editorial
      The problem of inferring ancestral genetic information in terms of a set of founders of a given population arises in various biological contexts. In optimization terms, this problem can be formulated as a combinatorial ...

    • Un estudio aplicado al problema del viajante del comercio con ventanas de tiempo 

      López Ibáñez, Manuel; Blum, Christian (2009)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Los algoritmos Beam-ACO son métodos híbridos que combinan la metaheurística de optimización basada en colonias de hormigas (Ant Colony Optimisation, ACO) con la búsqueda en haz (beam-search). Estos algotitmos dependen en ...

    • Variable neighbourhood search for the variable sized bin packing problem 

      Hemmelmayr, Vera C.; Schmid, Verena; Blum, Christian (2012-05)
      Article
      Accés restringit per política de l'editorial
      The variable sized bin packing problem is a generalisation of the one-dimensional bin packing problem. Given is a set of weighted items, which must be packed into a minimum-cost set of bins of variable sizes and costs. ...