Ara es mostren els items 1-20 de 23

  • A cost-benefit analysis of continuous assessment 

    Duch Brown, Amalia; Gabarró Vallès, Joaquim; Petit Silvestre, Jordi; Blesa Aguilera, Maria Josep; Serna Iglesias, María José (SciTePress, 2015)
    Text en actes de congrés
    Accés obert
    The first course on programming is fundamental in the Facultat d’Informàtica de Barcelona. After a major redesign of the Programming-1 course in 2006 to give it a more practical flavor, an increasing number of measures ...
  • Análisis de la evolución de un curso: productividad y desigualdad 

    Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Petit Silvestre, Jordi; Serna Iglesias, María José (Universidad de Almería, 2016-07-05)
    Comunicació de congrés
    Accés obert
    Este trabajo analiza cuantitativamente las diferentes medidas adoptadas en la evaluación contínua del curso de Programación-1 de la Facultat d’Informàtica de Barcelona de la Universitat Politècnica de Catalunya desde 2010, ...
  • 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 obert
    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 ...
  • Coaching on new technologies: programming workshop on Android applications for Google phones 

    Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Hernández, Hugo; Serna Iglesias, María José (2011-10)
    Article
    Accés restringit per política de l'editorial
    In this work we describe our experience teaching an innovative Android programming workshop organized by the Universitat Politècnica de Catalunya (UPC) within the AndroidEDU Google EMEA Program. The growing interest in ...
  • 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)
    Capítol de llibre
    Accés obert
    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. ...
  • 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
    Accés obert
    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. ...
  • Fixed partial match queries in quadtrees 

    Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
    Text en actes de congrés
    Accés obert
    Several recent papers in the literature have addressed the analysis of the cost P_{n,q} of partial match search for a given fixed query q - that has s out of K specified coordinates - in different multidimensional data ...
  • Implementing static synchronous sensor fields using NiMo 

    Clérici Martínez, Silvia Inés; Duch Brown, Amalia; Zoltan Torres, Ana Cristina (2009-05)
    Report de recerca
    Accés obert
    In this work we present some implementations of a Static Synchronous Sensor Field (SSSF), a static and synchronous model for sensor networks in which a finite set of sensing devices are geographically distributed and can ...
  • 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)
    Text en actes de congrés
    Accés obert
    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: 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
    Accés obert
    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 ...
  • On the average performance of fixed partial match queries in random relaxed K-d trees 

    Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (2014)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We obtain an explicit formula for the expected cost of a fixed partial match query in a random relaxed K-d tree, that is, the expected cost for a query of the form q = (q0 , q1 , . . . , qK-1 ) with 0 < s < K specified ...
  • On the average performance of orthogonal range search in multidimensional data structures 

    Duch Brown, Amalia; Martínez Parra, Conrado (2001-11)
    Report de recerca
    Accés obert
    In this work we present the average-case analysis of orthogonal range search for several multidimensional data structures. We first consider random relaxed K-d trees as a prototypical example and later extend our results ...
  • On the cost of fixed partial match queries in K-d trees 

    Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (2016-08-01)
    Article
    Accés obert
    Partial match queries constitute the most basic type of associative queries in multidimensional data structures such as K-d trees or quadtrees. Given a query q=(q0,…,qK-1) where s of the coordinates are specified and K-s ...
  • On the existence of Nash equilibria in strategic search games 

    Álvarez Faura, M. del Carme; Duch Brown, Amalia; Serna Iglesias, María José; Thilikos Touloupas, Dimitrios (2011)
    Text en actes de congrés
    Accés obert
    We consider a general multi-agent framework in which a set of n agents are roaming a network where m valuable and sharable goods (resources, services, information ....) are hidden in m different vertices of the network. ...
  • Partial match queries in relaxed K-dt trees 

    Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador (Society for Industrial and Applied Mathematics (SIAM), 2017)
    Text en actes de congrés
    Accés obert
    The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval. It was not until recently that fixed (as ...
  • Quad-kd trees: A general framework for kd trees and quad trees 

    Bereczky, Nikolett; Duch Brown, Amalia; Németh, Krisztián; Roura Ferret, Salvador (2016-02-22)
    Article
    Accés obert
    We introduce the quad-kd tree: a general purpose and hierarchical data structure for the storage of multidimensional points. Quad-kd trees include point quad trees and kd trees as particular cases and therefore they could ...
  • Randomized K-dimensional binary search trees 

    Martínez Parra, Conrado; Estivill-Castro, V.; Duch Brown, Amalia (1998-10-02)
    Report de recerca
    Accés obert
    This paper introduces randomized K-dimensional binary search trees (randomized Kd-trees), a variant of K-dimensional binary trees. This data structure allows the efficient maintenance of multidimensional records for ...
  • Rank selection in multidimensional data 

    Duch Brown, Amalia; Jiménez Gómez, Rosa María; Martínez Parra, Conrado (2009-11-04)
    Report de recerca
    Accés obert
    Suppose we have a set of K-dimensional records stored in a general purpose spatial index like a K-d tree. The index efficiently supports insertions, ordinary exact searches, orthogonal range searches, nearest neighbor ...
  • Sensor field: a computational model 

    Álvarez Faura, M. del Carme; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (2009)
    Article
    Accés restringit per política de l'editorial
    We introduce a formal model of computation for networks of tiny artifacts, the static synchronous sensor field model (SSSF) which considers that the devices communicate through a fixed communication graph and interact ...
  • Sensor field: a computational model 

    Álvarez Faura, M. del Carme; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (2009-09-23)
    Report de recerca
    Accés obert
    We introduce a formal model of computation for networks of tiny artifacts, the static synchronous sensor field model (SSSF) which considers that the devices communicate through a fixed communication graph and interact ...