Recent Submissions

  • LotterySampling: A randomized algorithm for the Heavy Hitters and Top-k problems in data streams 

    Martínez Parra, Conrado; Solera Pardo, Gonzalo (Springer, 2022)
    Part of book or chapter of book
    Open Access
    We propose a new randomized count-based algorithm to solve the Heavy Hitters and Top-k problems in data streams. This algorithm, called LotterySampling, uses the intuitive concept of “lottery tickets”, to decide which ...
  • A probabilistic model revealing shortcomings in Lua’s hybrid tables 

    Martínez Parra, Conrado; Nicaud, Cyril; Rotondo, Pablo (Springer, 2022)
    Part of book or chapter of book
    Open Access
    Lua (Ierusalimschy et al., 1996) is a well-known scripting language, popular among many programmers, most notably in the gaming industry. Remarkably, the only data-structuring mechanism in Lua, is an associative array ...
  • All power structures are achievable in basic weighted games 

    Freixas Bosch, Josep; Pons Vallès, Montserrat (Springer, 2023-04-09)
    Part of book or chapter of book
    Restricted access - publisher's policy
    A major problem in decision making is designing voting systems that are as simple as possible and able to reflect a given hierarchy of power of its members. It is known that in the class of weighted games all hierarchies ...
  • The decline of the Buchholz tiebreaker system: a preferable alternative 

    Freixas Bosch, Josep (Springer, 2023-01-20)
    Part of book or chapter of book
    Restricted access - publisher's policy
    We propose a simple method of undoing tiebreaks in sport competitions with a large number of competitors and relatively small number of rounds of competition. Such methods are common in many games including Chess, Go, ...
  • Decomposed process discovery and conformance checking 

    Carmona Vargas, Josep (Springer, 2018)
    Part of book or chapter of book
    Open Access
    Decomposed process discovery and decomposed conformance checking are the corresponding variants of the two monolithic fundamental problems in process mining (van der Aalst 2011): automated process discovery, which considers ...
  • Petri net analysis using boolean manipulation 

    Pastor Llorens, Enric; Roig Mansilla, Oriol; Cortadella, Jordi; Badia Sala, Rosa Maria (Springer, 1994)
    Part of book or chapter of book
    Open Access
    This paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed ...
  • A compositional method for the synthesis of asynchronous communication mechanisms 

    Costa Gorgônio, Kyller; Cortadella, Jordi; Xia, Fei (Springer, 2007-06-30)
    Part of book or chapter of book
    Open Access
    Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ACM synthesis method based on the generation ...
  • Nature inspired meta-heuristics for grid scheduling: single and multi-objective optimization approaches 

    Abraham, Ajith; Liu, Hongbo; Grosan, Crina; Xhafa Xhafa, Fatos (Springer, 2008)
    Part of book or chapter of book
    Open Access
    In this chapter, we review a few important concepts from Grid computing related to scheduling problems and their resolution using heuristic and meta-heuristic approaches. Scheduling problems are at the heart of any Grid-like ...
  • Parallel algorithms for two processors precedence constraint scheduling 

    Serna Iglesias, María José (Springer, 2016-06-07)
    Part of book or chapter of book
    Open Access
  • Randomized parallel approximations to max flow 

    Serna Iglesias, María José (Springer, 2016-06-07)
    Part of book or chapter of book
    Open Access
  • Continuous assessment in the evolution of a CS1 course: The pass rate/workload ratio 

    Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Petit Silvestre, Jordi; Serna Iglesias, María José (Springer, 2016)
    Part of book or chapter of book
    Open Access
    The first programming course (Programming-1, CS1) in the Informatics Engineering Degree of the Facultat d'Informàtica de Barcelona was completely redesigned in 2006 in order to reinforce the learn-by- doing methodology. ...