Now showing items 1-10 of 10

    • A note on the subgraphs of the (2×\infty)-grid 

      Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios (2010-02)
      Article
      Restricted access - publisher's policy
      We give a linear-time algorithm checking whether a graph is a subgraph of the (2×k)-grid for some value of k. Our algorithm is based on a detailed characterization of the structure of such graphs.
    • Agrupamiento de MANETs 

      López Toré, Anabel (Universitat Politècnica de Catalunya, 2009-12-22)
      Bachelor thesis
      Open Access
    • Algorítmica y programación para ingenieros 

      Gallego Fernández, María Isabel; Medina Llinàs, Manuel (Edicions UPC, 1993)
      Book
      Restricted access to the UPC academic community
      Esta obra introduce, desde el principio, los conceptos necesarios para el desarrollo de programas en un entorno técnico. En ella se da una importancia máxima al desarrollo de algoritmos, en los que esos programas se basan, ...
    • An automatic and general least-squares projection procedure for sweep meshing 

      Roca Navarro, Francisco Javier; Sarrate Ramos, Josep (2010-01-07)
      Article
      Open Access
    • BDDs for Pseudo-Boolean Constraints 

      Abío Roig, Ignasi; Nieuwenhuis, Robert Lukas Mario; Oliveras Llunell, Albert; Rodríguez Carbonell, Enric (Springer Verlag, 2011)
      Conference report
      Restricted access - publisher's policy
      Pseudo-Boolean constraints are omnipresent in practical applications, and therefore a significant effort has been devoted to the development of good SAT encoding techniques for these constraints. Several of these encodings ...
    • Estudio comparativo de algoritmos genéticos y algoritmos de búsqueda tabú para la resolución del Flow Shop Problem 

      Franco Flores, Abel (Universitat Politècnica de Catalunya, 2009-06)
      Master thesis (pre-Bologna period)
      Open Access
      El planteamiento de este proyecto presenta como objetivo el abordaje de un problema de secuenciación denominado Taller Mecánico, más conocido como Flow Shop Problem o Jobshop Problem (FSP).Otro problema sumamente importante ...
    • Iterated greedy algorithms for the maximal covering location problem 

      Rodríguez, Francisco J.; Blum, Christian; Lozano, Manuel; García Martínez, Carlos (2012)
      Article
      Restricted access - publisher's policy
      The problem of allocating a set of facilities in order to maximise the sum of the demands of the covered clients is known as the maximal covering location problem. In this work we tackle this problem by means of iterated ...
    • Online algorithms for change detection in information systems and web environments 

      Nikolic Fraguela, Ivan (Universitat Politècnica de Catalunya, 2013-06-21)
      Master thesis (pre-Bologna period)
      Open Access
      El projecte té com objectiu dissenyar algorismes online basats en técniques de data streaming i mètodes formals per monitoritzar el comportament dels processos que governen un sistema d'informació o una web.
    • SAT solvers i extensions 

      Lloret Llinares, Tomàs (Universitat Politècnica de Catalunya, 2007-06-13)
      Master thesis (pre-Bologna period)
      Open Access
    • Source-to-Source transformations for efficient SIMD code generation 

      Berna Juan, Alejandro; Jiménez Castells, Marta; Llaberia Griñó, José M. (2011)
      Conference report
      Open Access
      In the last years, there has been much effort in commercial compilers to generate efficient SIMD instructions-based code sequences from conventional sequential programs. However, the small numbers of compilers that can ...