Now showing items 21-40 of 47

  • Economía aplicada al estudio de la evolución de un curso 

    Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Petit Silvestre, Jordi; Serna Iglesias, María José (Asociación de Enseñantes Universitarios de la Informática (AENUI), 2017)
    Article
    Open Access
    In this paper we propose a method to quantitatively analyze the effectiveness of the different measures taken to improve a course’s evaluation process. Our proposal uses simple tools from economics and the social sciences. ...
  • Efficient parallel LAN/WAN algorithms for optimization: The mallba project 

    Alba, E.; Almeida, F.; Blesa Aguilera, Maria Josep; Cotta Porras, Carlos; Díaz, M.; Dorta, Isabel; Gabarró Vallès, Joaquim; León Hernández, Coromoto; Luque, G.; Petit Silvestre, Jordi; Rodríguez, C.; Rojas, A.; Xhafa Xhafa, Fatos (2006-06)
    Article
    Open Access
    The mallba project tackles the resolution of combinatorial optimization problems using generic algorithmic skeletons implemented in C++. A skeleton in the mallba library implements an optimization method in one of the three ...
  • Experiments on the minimum linear arrangement problem 

    Petit Silvestre, Jordi (2001-02)
    External research report
    Open Access
    This paper deals with the Minimum Linear Arrangement problem from an experimental point of view. Using a test-suite of sparse graphs, we experimentally compare several algorithms to obtain upper and lower bounds ...
  • Faulty random geometric networks 

    Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José (2000-10)
    External research report
    Open Access
    In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We first analyze how to emulate an original ...
  • Generic parallel implementations for Tabu Search 

    Blesa Aguilera, Maria Josep; Petit Silvestre, Jordi; Xhafa Xhafa, Fatos (2005-11)
    External research report
    Open Access
    Tabu Search (TS) is a meta-heuristic for solving combinatorial optimization problems. A review of existing implementations for TS reveals that, on the one hand, these implementations are ad hoc and, on the other hand, most ...
  • Hamiltonian cycles in faulty random geometric networks 

    Petit Silvestre, Jordi (2001-03)
    External research report
    Open Access
    In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks. A random geometric network is a graph whose vertices correspond ...
  • Heuristics for the MinLA problem: an empirical and theoretical analysis 

    Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José; Spirakis, Paul George (1998-07)
    External research report
    Open Access
    This paper considers the development and the analysis of Local Search heuristics to approximate the Minimum Linear Arrangement problem. First of all, we present a new heuristic that we call SS+SA based on the combination ...
  • Heuristics for the MinLA problem: some theoretical and empirical considerations 

    Díaz Cort, Josep; Petit Silvestre, Jordi; Spirakis, Paul George; Serna Iglesias, María José (1998-03)
    External research report
    Open Access
    This paper deals with some aspects on finding good solutions for the Minimum Linear Arrangement problem (MinLA). We consider some random type of sparse graphs, for which it is possible to obtain trivial constant ...
  • High level communication functionalities for wireless sensor networks 

    Álvarez Faura, M. del Carme; Díaz Cort, Josep; Petit Silvestre, Jordi; Rolim, José; Serna Iglesias, María José (2004-11)
    External research report
    Open Access
    In this work we propose a way to establish a reliable and efficient high level communication system in a randomly deployed network of sensors equipped with directional antennas. This high level communication system will ...
  • Joc d’estructures de dades i algorismes 

    Duch Brown, Amalia; Petit Silvestre, Jordi; Rodríguez Carbonell, Enric; Roura Ferret, Salvador (Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2014-04-24)
    Conference report
    Open Access
    L'activitat consisteix en la implementació d'un jugador per a un joc d'ordinador. L'objectiu és que els estudiants hi apliquin els algorismes i estructures de dades explicats en el curs. Un joc consisteix en un tauler on ...
  • Jutge.org 

    Giménez, Omer; Petit Silvestre, Jordi; Roura Ferret, Salvador (2011)
    External research report
    Open Access
    Jutge.org is an open access educational online programming judge where students can try to solve more than 800 problems using 22 programming languages. The verdict of their solutions is computed using exhaustive test sets ...
  • Jutge.org: characteristics and experiences 

    Petit Silvestre, Jordi; Roura Ferret, Salvador; Carmona Vargas, Josep; Cortadella, Jordi; Duch Brown, Amalia; Giménez, Omer; Mani, Anaga; Mas Rovira, Jan; Rodríguez Carbonell, Enric; Rubio Gimeno, Alberto; San Pedro Martín, Javier de; Venkataramani, Divya (2018-07)
    Article
    Open Access
    Jutge.org is an open educational online programming judge designed for students and instructors, featuring a repository of problems that is well organized by courses, topics and difficulty. Internally, Jutge.org uses a ...
  • Linear orderings of random geometric graphs (extended abstract) 

    Díaz Cort, Josep; Penrose, Matthew; Petit Silvestre, Jordi; Serna Iglesias, María José (1999-04)
    External research report
    Open Access
    In random geometric graphs, vertices are randomly distributed on [0,1]^2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices ...
  • Lists revisited: cache conscious STL lists 

    Frias Moya, Leonor; Petit Silvestre, Jordi; Roura Ferret, Salvador (2005-11)
    External research report
    Open Access
    We present three cache conscious implementations of STL standard compliant lists. Up to now, one could either find simple double linked list implementations that easily cope with standard strict requirements, or theoretical ...
  • MALLBA: a library of skeletons for combinatorial optimisation 

    Alba, E; Almeida, F; Blesa Aguilera, Maria Josep; Cabeza, J; Cotta, C; Díaz, M; Dorta, I; Gabarró Vallès, Joaquim; León, C; Luna Garcia, Jesus; Moreno Boronat, Lidia Ana; Pablos, C; Petit Silvestre, Jordi; Rojas Espinosa, Alfonso; Xhafa Xhafa, Fatos (2002-02)
    External research report
    Open Access
    The MALLBA project tackles the resolution of combinatorial optimization problems using algorithmic skeletons implemented in C++. MALLBA offers three families of generic resolution methods: exact, heuristic and hybrid. ...
  • MALLBA: towards a combinatorial optimization library for geographically distributed systems 

    Alba, E.; Almeida, F.; Blesa Aguilera, Maria Josep; Cotta, C.; Díaz, M.; Dorta, I.; Gabarró Vallès, Joaquim; González, J.; León, C.; Moreno de Antonio, Luz Marina; Petit Silvestre, Jordi; Roda, J.; Rojas, A.; Xhafa Xhafa, Fatos (2001-06)
    External research report
    Open Access
    Problems arising in different areas such as numerical methods, simulation or optimization can be efficiently solved by parallel super-computing. However, it is not always possible to buy and maintain parallel super-computers. ...
  • ParaDict, a data parallel library for dictionaries 

    Gabarró Vallès, Joaquim; Petit Silvestre, Jordi (1996-05)
    External research report
    Open Access
    We present ParaDict, a library for data parallel dictionaries written in C* having two different interfaces. The first one is written in C* for data parallel users and the second one in C for users that want to use a ...
  • Parallel partition revisited 

    Frias Moya, Leonor; Petit Silvestre, Jordi (2008-02)
    External research report
    Open Access
    In this paper we consider parallel algorithms to partition an array with respect to a pivot. We focus on implementations for current widely available multi-core architectures. After reviewing existing algorithms, we propose ...
  • PgaFrame: user documentation 

    Petit Silvestre, Jordi (1997-05)
    External research report
    Open Access
    The PgaFrame ---a frame for parallel genetic algorithms--- offers to non-experts the possibility to solve optimization problems via genetic algorithms on parallel computers. This frame has appeared as the natural fusion ...
  • Physical-aware system-level design for tiled hierarchical chip multiprocessors 

    Cortadella, Jordi; San Pedro Martín, Javier de; Nikitin, Nikita; Petit Silvestre, Jordi (ACM Press. Association for Computing Machinery, 2013)
    Conference report
    Open Access
    Tiled hierarchical architectures for Chip Multiprocessors (CMPs) represent a rapid way of building scalable and power-e fficient many-core computing systems. At the early stages of the design of a CMP, physical parameters ...