Recent Submissions

  • Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional Knapsack problem: Which one works better when? 

    Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian (Springer, 2017)
    Conference lecture
    Open Access
    Both, Construct, Merge, Solve and Adapt (CMSA) and Large Neighborhood Search (LNS), are hybrid algorithms that are based on iteratively solving sub-instances of the original problem instances, if possible, to optimality. ...
  • A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (Institute of Electrical and Electronics Engineers (IEEE), 2017)
    Conference lecture
    Open Access
    The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ...
  • An angel-daemon approach to assess the uncertainty in the power of a collectivity to act 

    Fragnito, Giulia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (Springer, 2017)
    Conference report
    Open Access
    We propose the use of the angel-daemon framework to assess the Coleman's power of a collectivity to act under uncertainty in weighted voting games. In this framework uncertainty profiles describe the potential changes ...
  • A datalog framework for modeling relationship-based access control policies 

    Pasarella Sánchez, Ana Edelmira; Lobo, Jorge (Association for Computing Machinery (ACM), 2017)
    Conference report
    Open Access
    Relationships like friendship to limit access to resources have been part of social network applications since their beginnings. Describing access control policies in terms of relationships is not particular to social ...
  • Proof complexity meets algebra 

    Atserias, Albert; Ochremiak, Joanna (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017)
    Conference report
    Open Access
    We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional and semi-algebraic proof systems, the classical constructions ...
  • An equational approach to concurrency 

    Orejas Valdés, Fernando (Universidad del Pais Vasco, 1982)
    Conference lecture
    Open Access
    In this paper, we describe how can we use equations to specify the behavour of concurrent processes.
  • Aligning textual and graphical descriptions of processes through ILP techniques 

    Sànchez-Ferreres, Josep; Carmona Vargas, Josep; Padró, Lluís (Springer, 2017)
    Conference lecture
    Open Access
    With the aim of having individuals from different backgrounds and expertise levels examine the operations in an organization, different representations of business processes are maintained. To have these different ...
  • Parametrización de tipos estructurados de datos 

    Orejas Valdés, Fernando (Asociación Española de Informática y Automática (AEIA), 1979)
    Conference report
    Open Access
    En trabajos anteriores de había presentado un nuevo modelo, funcional y constructivo, para la especificación de tipos estructurados de datos. En este trabajo se extiende el modelo con la definición del concepto de ...
  • Un nuevo enfoque jerárquico para la reescritura condicional 

    Navarro Gomez, Marisa; Orejas Valdés, Fernando (Asociación Española de Informática y Automática, 1985)
    Conference report
    Open Access
    En este artículo se presenta un nuevo método de reescritura orientado a la ejecución de especificaciones condicionales y basado en la noción de jerarquía. este método, como otros métodos jerárquicos, evita los problemas ...
  • Anotaciones de Merlín, comportamiento de universos y semántica algebraica 

    Nivela Alós, M. Pilar Brígida; Orejas Valdés, Fernando (E.T.S.I. de Telecomunicación, 1985)
    Conference report
    Open Access
    En este trabajo se presentan las ideas básicas seguidas para el diseño de un lenguaje de anotaciones para el lenguaje de programación Merlín. En concreto, las anotaciones se prevén en forma de especificaciones ecuacionales ...
  • Anti-alignments in conformance checking: the dark side of process models 

    Chatain, Thomas; Carmona Vargas, Josep (Springer, 2016)
    Conference report
    Open Access
    Conformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the wellknown state space ...
  • Trade-offs between time and memory in a tighter model of CDCL SAT solvers 

    Elffers, J.; Johannsen, Jan; Lauria, Massimo; Magnard, Thomas; Nordström, Jakob; Vinyals, Marc (2016)
    Conference report
    Open Access
    A long line of research has studied the power of conflict- driven clause learning (CDCL) and how it compares to the resolution proof system in which it searches for proofs. It has been shown that CDCL can polynomially ...

View more