Recent Submissions

  • A quality-assuring, combinatorial auction based mechanism for IoT-based crowdsourcing 

    Kumar Singh, Vikash; Mukhopadhyay, Sajal; Xhafa Xhafa, Fatos; Krause, Paul (2020-03)
    Part of book or chapter of book
    Restricted access - publisher's policy
    In this chapter, we study some research issues from IoT-based crowdsourcing in a strategic setting. We have considered the scenario in IoT-based crowdsourcing, where there are multiple task requesters and multiple IoT ...
  • The vision of Edges of Internet as a computing fabric 

    Xhafa Xhafa, Fatos (2020-03)
    Part of book or chapter of book
    Restricted access - publisher's policy
    Edge computing has emerged as a major disrupting technology after Cloud computing to fill in the computational and infrastructural gaps in IoT and Mobile Cloud computing. Indeed, IoT and Mobile Cloud computing are based ...
  • 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 ...
  • On the universality of Zipf's law for word frequencies 

    Ferrer Cancho, Ramon (Walter de Gruyter, 2007)
    Part of book or chapter of book
    Open Access
    It is hard to imagine how the development of quantitative linguistics would have been after G.K. Zipf’s untimely death without the work of G. Altmann. This article aims to honour a living giant of the Zipfian school of ...
  • 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 ...
  • Big data analytics for obesity prediction 

    Bilal, Hasan; Vellido Alcacena, Alfredo; Ribas Ripoll, Vicent (IOS Press, 2018)
    Part of book or chapter of book
    Open Access
    Feature selection (FS) is essential for the analysis of genomic datasets with millions of features. In such context, Big Data tools are paramount, but the use of standard machine learning models is limited for data with ...
  • 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 ...
  • Using contextual information in music playlist recommendations 

    Gkatzioura, Anna; Sànchez-Marrè, Miquel (IOSPress, 2017)
    Part of book or chapter of book
    Open Access
    Recommender Systems have become a fundamental part of various applications supporting users when searching for items they could be interested in,at a given moment. However, the majority of Recommender ...
  • University teaching culture 

    Pérez Poch, Antoni; Domingo Peña, Joan; Sanz Gómez, M. Carmen; López Álvarez, David (Octaedro, 2018-06)
    Part of book or chapter of book
    Open Access
    The CIDUI experience has been an unforgettable learning process for us all. At the time of writing these introductory pages, we had doubts about the topics that should be included. Maybe the ideas and great debates about ...
  • The Greedy Algorithm and the Cohen-Macaulay property of rings, graphs and toric projective curves 

    Arratia Quesada, Argimiro Alejandro (Springer, 2018)
    Part of book or chapter of book
    Restricted access - publisher's policy
    It is shown in this paper how a solution for a combinatorial problem obtained from applying the greedy algorithm is guaranteed to be optimal for those instances of the problem that, under an appropriate algebraic representation, ...
  • Parallel memetic algorithms for independent job scheduling in computational grids 

    Xhafa Xhafa, Fatos; Duran, Bernat (Springer, 2008)
    Part of book or chapter of book
    Open Access
    In this chapter we present parallel implementations of Memetic Algorithms (MAs) for the problem of scheduling independent jobs in computational grids. The problem of scheduling in computational grids is known for its high ...
  • 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 ...

View more