Reports de recerca: Enviaments recents

Ara es mostren els items 13-24 de 139

    • Message complexity lower bounds for decentralized anonymous wave algorithms 

      Atserias, Albert (1996)
      Report de recerca
      Accés obert
      We prove an ¿(D|E|) lower bound on the message complexity of decentralized anonymous wave algorithms for the unidirectional ring, the hypercube and the clique. Here D is the diameter and E the number of edges of the network. ...

    • Una aproximacio senzilla a Java 

      Gabarró Vallès, Joaquim (1998-05)
      Report de recerca
      Accés obert
      Aquí teniu el material de laboratori fet per a l'assignatura Algoritmes Distribuïts durant el curs 97-98. Està escrit per permetre una aproximació senzilla a Java. Hi trobareu els següents tòpics: aplicacions senzilles, ...

    • Un sistema eficient de representació i accés a grans volums d'informació léxica 

      Carmona Vargas, Josep (1998)
      Report de recerca
      Accés obert

    • Temari IB1 

      Brunet Crosa, Pere; Martínez Parra, Conrado; Merenciano Saladrigas, Josep Maria; Pueyo Sánchez, Xavier; Solano Albajés, Lluís; Soto Riera, Antoni; Vila Marta, Sebastià (1996-09-10)
      Report de recerca
      Accés obert

    • Manual d'introducció a la llibreria de pas de missatges MPI 

      Moral Boadas, Sandra; Petit Silvestre, Jordi (1996-10)
      Report de recerca
      Accés obert

    • FIT: a Frame Instantiator Tool 

      Petit Silvestre, Jordi; Giribet, Jordi; Thomas, Römke; Dralle, Uwe (1996-12)
      Report de recerca
      Accés obert
      The Frame Instantiator Tool (FIT), a graphical interface to give concrete values to abstract parameters of general problems is presented. It is designed to be an important part of Frames, an environment for developing ...

    • Fonaments teòrics del paral·lelisme : apunts del curs de doctorat 

      Gabarró Vallès, Joaquim; Martínez Parra, Conrado (1994-11)
      Report de recerca
      Accés obert
      This manuscript consists of the lecture notes for the doctorate course Theoretical Foundations of Parallelism taugth in 1994. The notes were written by the students and they are not meant to be in polished form.

    • Informàtica bàsica II, ETSEIB. Memòria del curs 1994-1995 

      Vila Marta, Sebastià; Pla García, Núria; Soto Riera, Antoni; Pérez Vidal, Lluís; Roura Ferret, Salvador; Franquesa Niubó, Marta; Cotrina Navau, Josep; Alquézar Mancho, René; Martínez Parra, Conrado (1995-02-06)
      Report de recerca
      Accés obert
      Memòria de l'assignatura d'Infomàtica bàsica II del curs 94-95.

    • 1849-2016 - IEEE Standard for eXtensible Event Stream (XES) for achieving interoperability in event logs and event streams 

      Van der Aalst, Wil M.P.; Günther, Christian; Bose, J. C.; Carmona Vargas, Josep; Dumas, Marlon; van Geffen, Frank; Goel, Sukriti; Guzzo, Antonella; Khalaf, Rania; Kuhn, Rudolf; Lehto, Teemu; Mannhardt, Felix (2016-09-22)
      Report de recerca
      Accés restringit per política de l'editorial
      Abstract: A grammar for a tag-based language whose aim is to provide designers of information systems with a unified and extensible methodology for capturing systems behaviors by means of event logs and event streams is ...

    • Adaptive logspace reducibility and parallel time 

      Álvarez Faura, M. del Carme; Balcázar Navarro, José Luis; Jenner, Birgit (1991-11)
      Report de recerca
      Accés obert
      We discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still ...

    • The design of a parallel algorithm to solve the word problem for the free partially commutative groups 

      Gabarró Vallès, Joaquim (1991-10-15)
      Report de recerca
      Accés obert
      We develop a parallel algorithm to solve the word problem for free partially commutative groups. These groups were introduced by C. Wrathall to generalize free groups. We represent the elements of these groups as a certain ...

    • A generalization of the model of permutations for binary search trees 

      Messeguer Peypoch, Xavier (1991-09-30)
      Report de recerca
      Accés obert
      The classical model of permutations, that allows the study of consecutive insertions in BST, fails when it considers intermixed deletions and insertions (Knott paradox). Our model solves this paradox by considering the ...