Enviaments recents

  • Measuring satisfaction in societies with opinion leaders and mediators 

    Molinero Albareda, Xavier; Riquelme Csori, F.; Serna Iglesias, María José (2016-05-14)
    Report de recerca
    Accés obert
    An opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered:
  • Firefighting as a Game 

    Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Molter, Hendrik (2014)
    Report de recerca
    Accés obert
    The Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of deseases and the containment ...
  • A graph-semantics of business configurations 

    Fiadeiro, José Luiz; Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando (2014)
    Report de recerca
    Accés obert
    In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML. To achieve this goal we develop a new graph transformation system for what we call 2-level symbolic graphs. ...
  • Hierarchical conformance checking of process models based on event logs 

    Muñoz Gama, Jorge; Carmona Vargas, Josep; Aalst, Wil M.P. van der (2013)
    Report de recerca
    Accés obert
    Process mining techniques aim to extract knowledge from event logs. Conformance checking is one of the hard problems in process mining: it aims to diagnose and quantify the mismatch between observed and modeled behavior. ...
  • Fringe analysis of synchronized parallel algorithms on 2--3 trees 

    Baeza-Yates, R; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier (1998-06)
    Report de recerca
    Accés obert
    We are interested in the fringe analysis of synchronized parallel insertion algorithms on 2—3 trees namely the algorithm of W.Paul U. Vishkin and H. Wagener PVW. This algorithm inserts k keys into a tree of size n with ...
  • Simple and efficient tree comparison 

    Valiente Feruglio, Gabriel Alejandro (2001-01-08)
    Report de recerca
    Accés obert
    A new distance metric for rooted trees is presented which is based on the largest common forest of two rooted trees. The new measure is superior to previous measures based on tree edit distance, because no particular ...
  • Tree edit distance and common subtrees 

    Valiente Feruglio, Gabriel Alejandro (2002-02)
    Report de recerca
    Accés obert
    The relationship between tree edit distance and maximum common subtrees is established, showing that a tree edit distance constrained by insertion and deletions on leaves only and by a simple condition on the cost of ...
  • Exponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs 

    Hajiaghayi, Mohammad Taghi; Demaine, Erik D.; Thilikos Touloupas, Dimitrios (2002-03)
    Report de recerca
    Accés obert
    We present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K_{5} or K_3,3 as a minor in time O(3^{6sqrt{34 k}}n^{O(1)}). In fact, we present our ...
  • Classes of term rewrite systems with polynomial confluence problems 

    Godoy Balil, Guillem; Nieuwenhuis, Robert Lukas Mario (2002-06-06)
    Report de recerca
    Accés obert
    The confluence property of ground (i.e., variable-free) term rewrite systems (GTRS) is well-known to be decidable. This was proved independently in [DTHL87,DHLT90] and in [Oya87] using tree automata techniques and ground ...
  • Bounds on the max and min bisection of random cubic and 4-regular graphs 

    Díaz Cort, Josep; Do, Norman; Serna Iglesias, María José; Wormald, Nick (2002-12)
    Report de recerca
    Accés obert
    In this paper we present simple randomized algorithms to bisect cubic and 4-regular graphs. These algorithms produce bisections of size asymptotically at most 0.17404n for typical random cubic n-vertex graphs, and ...

Mostra'n més