Now showing items 1-20 of 597

    • A bounded dynamic programming algorithm for the blocking flow shop problem 

      Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Companys Pascual, Ramón; Ribas Vila, Immaculada (IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
      Part of book or chapter of book
      Restricted access - publisher's policy
      We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known ...
    • A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs 

      Ferrer Biosca, Alberto; Guimarans, Daniel; Ramalhinho Lourenço, Helena; Juan Pérez, Ángel Alejandro (2016-02-01)
      Article
      Open Access
      This paper analyzes a realistic variant of the Permutation Flow-Shop Problem (PFSP) by considering a non-smooth objective function that takes into account not only the traditional makespan cost but also failure-risk costs ...
    • A communication-based algorithm to avoid the human body effect on antennas 

      Martínez García, Javier (Universitat Politècnica de Catalunya, 2011-07-21)
      Master thesis (pre-Bologna period)
      Open Access
      Covenantee:   Qing hua da xue
      English: The aim of this project is to design and implement a simple and reliable system able to minimize the negative effect that users cause on the antenna performance of mobile devices when interacting with these. The ...
    • A comparative study of recommender algorithms for a gastronomic social network 

      Bermeo Quezada, Franz (Universitat Politècnica de Catalunya, 2015-07)
      Master thesis
      Restricted access - confidentiality agreement
    • A contribution on adaptive coding strategies over H.F. channels 

      Dalmau Royo, Jordi; Delgado Penin, José Antonio (1989)
      Conference report
      Open Access
      We present a coding scheme which makes use of adaptive coding techniques. Since we are concerned with the H,F, channel, suitable coding schemes are needed to combat diffuse errors [1], i. e, random and burst errors, ...
    • A formal analisys of the computational dynamics in GIGANTEC 

      Badr, Amr (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2001)
      Article
      Open Access
      An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical ...
    • A general adaptive algorithm for nonGaussian source separation without any constraint 

      Lagunas Hernandez, Miguel A. (1994)
      Conference report
      Open Access
      This paper deals with the blind source separation. The task consists in separating some independent and linearly mixed signals called sources. After some general remarks, the model is recalled and our approach based on the ...
    • A genetic algorithm for the mixed flow shop problem 

      Pascual Poch, Mario (Universitat Politècnica de Catalunya, 2019-10-16)
      Master thesis
      Open Access
      Covenantee:   Università degli studi di Trento
      In this thesis we present a new interesting version of the mixed flow shop se-quencing problem, which at the same time is a version of the classic flow shop,a very common topic on operations research.We propose a genetic ...
    • A GRASP algorithm for quota sequences with minimum work overload and forced interruption of operations in a mixed-product assembly line 

      Bautista Valhondo, Joaquín; Alfaro Pozo, Rocío (Springer, 2018-03-13)
      Article
      Open Access
      We present a GRASP algorithm to solve a problem that involves the sequencing of mixed products in an assembly line. The objective of the problem is to obtain a manufacturing sequence of models that generates a minimum work ...
    • A GRASP-based algorithm for the optimised DIF allocation in the RINA network architecture 

      Keshavarz, Pegah (Universitat Politècnica de Catalunya, 2013-12-13)
      Master thesis
      Open Access
      [ANGLÈS] Reviewing the current internet and its problems and introducing the new architecture of internet RINA, and find a minimized cost route to allocate demands in the network by using the GRASP algorithm.
    • A hybrid evolutionary approach to intelligent system design 

      Badr, Amr; Farag, Ibrahim; Eid, Saad (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 1999)
      Article
      Open Access
      The problem of developing a general methodology for system design has always been demanding. For this purpose, an evolutionary algorithm, adapted with design-specific representation data structures is devised. The ...
    • A Jacobi-based algorithm for computing symmetric eigenvalues and eigenvectors in a two-dimensional mesh 

      Royo Vallés, María Dolores; Valero García, Miguel; González Colás, Antonio María (Institute of Electrical and Electronics Engineers (IEEE), 1998)
      Conference report
      Open Access
      The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one-sided Jacobi approach and is targeted to a multicomputer in which nodes can be arranged as a two-dimensional mesh with ...
    • A learning approach to the FOM problem 

      Romo Grau, Eudald (Universitat Politècnica de Catalunya, 2017-05)
      Bachelor thesis
      Open Access
      Covenantee:   Massachusetts Institute of Technology
      Hogan recently provided an heuristic technique called family of modes (FOM) to solve model predictive control (MPC) problems under hybrid constraints and underactuation. The goal of this study is to further develop this ...
    • A machine learning approach to the identification of encrypted web traffic 

      Marías Pérez, Rubén (Universitat Politècnica de Catalunya, 2017-06-29)
      Bachelor thesis
      Restricted access - confidentiality agreement
    • A multiplicative Schwarz method with active subdomains for transient convection-diffusion problems 

      Sandoval Solis, M. Luisa; Rodríguez Ferran, Antonio (2009-02-04)
      Article
      Open Access
      An efficient algorithm to find the solution of transient convection–diffusion problems with dominant convection is presented. The main idea is to follow the solution front and activate those subdomains where the solution ...
    • A new algorithm for adaptive IIR filtering based on the log-area-ratio parameters 

      Rodríguez Fonollosa, José Adrián; Masgrau Gómez, Enrique José (Elsevier, 1990)
      Conference report
      Open Access
    • A new character-level encryption algorithm: how to implement cryptography in an ICT classroom 

      Arboledas Brihuega, David (OmniaScience, 2019-09)
      Article
      Open Access
      It is evident that the society in which we live will demand more and more qualified and specialized positions in the different branches of engineering. Now we are in a highly digitized world in which information is ...
    • A new computational approach to ideal theory in number fields 

      Guàrdia Rubies, Jordi; Montes Peral, Jesús; Nart Vinyals, Enric (2013)
      Article
      Open Access
      Let K be the number field determined by a monic irreducible polynomial f(x) with integer coefficients. In previous papers we parameterized the prime ideals of K in terms of certain invariants attached to Newton polygons ...
    • A new mapping algorithm for systolic array based IP Lookup architectures 

      Yalinkaya, Serhat (Universitat Politècnica de Catalunya, 2018-02)
      Master thesis
      Open Access
      A new mapping algorithm is proposed for SRAM based systolic array design. The new mapping algorithm provides more balance in memory distribution which results in less memory requirement while throughput is either improved ...
    • A new meta-module for efficient reconfiguration of hinged-units modular robots 

      Parada, Irene; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Institute of Electrical and Electronics Engineers (IEEE), 2016)
      Conference report
      Open Access
      We present a robust and compact meta-module for edge-hinged modular robot units such as M-TRAN, SuperBot, SMORES, UBot, PolyBot and CKBot, as well as for central-point-hinged ones such as Molecubes and Roombots. Thanks ...