Now showing items 1-20 of 608

    • 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 (2011)
      Conference report
      Restricted access - publisher's policy
      We present some results attained with two variants of 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 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 comparison of different optimisation search methodologies for self-optimisation in wireless cellular networks 

      Sánchez González, Juan; Sallent Roig, José Oriol; Pérez Romero, Jordi; Agustí Comes, Ramon (Institute of Electrical and Electronics Engineers (IEEE), 2013)
      Conference report
      Restricted access - publisher's policy
      Self-Organising Networks (SON) concept is seen as a way to reduce costs by automating functionalities such as network optimisation usually performed manually with extensive human work time. This paper provides a general ...
    • 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 data mining approach to identify cognitive NeuroRehabilitation Range in Traumatic Brain Injury patients 

      García Rudolph, Alejandro; Gibert, Karina (2014-09-01)
      Article
      Restricted access - publisher's policy
      Cognitive rehabilitation (CR) treatment consists of hierarchically organized tasks that require repetitive use of impaired cognitive functions in a progressively more demanding sequence. Active monitoring of the progress ...
    • A discrete optimization problem in local networks and data alignment 

      Fiol Mora, Miquel Àngel; Andrés Yebra, José Luis; Alegre de Miguel, Ignacio; Valero Cortés, Mateo (1987-06)
      Article
      Restricted access - publisher's policy
      This paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data memory, allocation and data alignment in SIMD processors. Consider ...
    • A distributed energy-aware routing algorithm in software-defined networks 

      Fernández Fernández, Adriana; Cervelló Pastor, Cristina; Ochoa Aday, Leonardo (2016)
      Conference report
      Restricted access - publisher's policy
      In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale software-defined networks (SDN) with multiple domains. The solution proposed, called ...
    • A dynamic pricing algorithm for a network of virtual resources 

      Naudts, Bram; Flores Méndez, Mario Rogelio; Mijumbi, Rashid; Verbrugge, Sofie; Serrat Fernández, Juan; Colle, Didier (Institute of Electrical and Electronics Engineers (IEEE), 2016)
      Conference report
      Restricted access - publisher's policy
      A service chain is a combination of network services (e.g. network address translation (NAT), a firewall, etc.) that are interconnected to support an application (e.g. video-on-demand). Building a service chain requires a ...
    • 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-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 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 multiobjective GRASP for the 1/3 variant of the time and space assembly line balancing problem 

      Chica, Manuel; Cordon, Oscar; Damas, Sergio; Bautista Valhondo, Joaquín (Springer Verlag, 2010-06-01)
      Part of book or chapter of book
      Restricted access - publisher's policy
      Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems, involving the joint optimisation of conflicting criteria such as the cycle ...
    • 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 deep reinforcement learning architecture for autonomous UAVs 

      Muñoz Ferran, Guillem (Universitat Politècnica de Catalunya, 2018-09-07)
      Bachelor thesis
      Open Access
      Recent improvements in computation and algorithmic research, together with the rising era of Big Data, have allowed Artificial Intelligence increase its popularity within masses. The recent publication of the Deep Q-Network ...