Now showing items 1-2 of 2

    • A probabilistic beam search approach to the shortest common supersequence problem 

      Blum, Christian; Cotta, C.; Fernández, Antonio J.; Gallardo, Francisco (2006-11)
      External research report
      Open Access
      The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic ...
    • MALLBA: towards a combinatorial optimization library for geographically distributed systems 

      Alba, E.; Almeida, F.; Blesa Aguilera, Maria Josep; Cotta, C.; Díaz, M.; Dorta, I.; Gabarró Vallès, Joaquim; González, J.; León, C.; Moreno de Antonio, Luz Marina; Petit Silvestre, Jordi; Roda, J.; Rojas, A.; Xhafa Xhafa, Fatos (2001-06)
      External research report
      Open Access
      Problems arising in different areas such as numerical methods, simulation or optimization can be efficiently solved by parallel super-computing. However, it is not always possible to buy and maintain parallel super-computers. ...