Enviaments recents

  • The HOM problem is EXPTIME-complete 

    Creus López, Carles; Gascon Caro, Adrian; Godoy Balil, Guillem; Ramos Garrido, Lander (2016)
    Article
    Accés obert
    We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on ...
  • Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (2016-03)
    Article
    Accés obert
    In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, ...
  • On the stability of generalized second price auctions with budgets 

    Díaz Cort, Josep; Giotis, Ioannis; Kirousis, Lefteris; Markakis, Evangelos; Serna Iglesias, María José (2016-07)
    Article
    Accés restringit per política de l'editorial
    The Generalized Second Price (GSP) auction used typically to model sponsored search auctions does not include the notion of budget constraints, which is present in practice. Motivated by this, we introduce the different ...
  • Amalgamation of domain specific languages with behaviour 

    Duran, Francisco; Moreno Delgado, Antonio; Orejas Valdés, Fernando; Zschaler, Steffen (2017-01-01)
    Article
    Accés restringit per política de l'editorial
    Domain-specific languages (DSLs) become more useful the more specific they are to a particular domain. The resulting need for developing a substantial number of DSLs can only be satisfied if DSL development can be made as ...
  • Comparing MapReduce and pipeline implementations for counting triangles 

    Pasarella Sánchez, Ana Edelmira; Vidal, Maria-Esther; Zoltan Torres, Ana Cristina (2017-01-11)
    Article
    Accés obert
    A common method to define a parallel solution for a computational problem consists in finding a way to use the Divide and Conquer paradigm in order to have processors acting on its own data and scheduled in a parallel ...
  • Narrow proofs may be maximally long 

    Atserias, Albert; Lauria, Massimo; Nordström, Jakob (2016-07-03)
    Article
    Accés obert
    We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n(Omega(w)). This shows that the simple counting argument that any formula refutable ...
  • Firefighting as a strategic game 

    Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Molter, Hendrik (Taylor & Francis, 2016-03-31)
    Article
    Accés obert
    The Firefighter Problem was proposed in 1995 as a deterministic discrete-time model for the spread and containment of a fire. The problem is defined on an undirected finite graph G = (V, E), where fire breaks out initially ...
  • Celebrity games 

    Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Messegué Buisan, Arnau; Serna Iglesias, María José (2016-10-04)
    Article
    Accés restringit per política de l'editorial
    We introduce Celebrity games, a new model of network creation games. In this model players have weights (W being the sum of all the player's weights) and there is a critical distance ß as well as a link cost a. The cost ...
  • Network formation for asymmetric players and bilateral contracting 

    Álvarez Faura, M. del Carme; Serna Iglesias, María José; Fernández, Aleix (2016-10-01)
    Article
    Accés obert
    We study a network formation game where players wish to send traffic to other players. Players can be seen as nodes of an undirected graph whose edges are defined by contracts between the corresponding players. Each player ...
  • Dimension and codimension of simple games 

    Kurz, Sascha; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2016-11-01)
    Article
    Accés restringit per política de l'editorial
    This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with ...

Mostra'n més