Exploració per tema "Algorithms"
Ara es mostren els items 1-20 de 833
-
3 and 4-separable binary codes existence by the Lovász Local Lemma in application to collusion-secure fingerprinting for digital data
(Universitat Politècnica de Catalunya, 2022-02-02)
Treball Final de Grau
Accés obertAlgorithm implementations in order to calculate the existance and the rate of a 3-separable code which is needed to implement fingerprints. -
A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem
(2011)
Text en actes de congrés
Accés restringit per política de l'editorialWe 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
(2016-02-01)
Article
Accés obertThis 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
(Universitat Politècnica de Catalunya, 2015-07)
Projecte Final de Màster Oficial
Accés restringit per acord de confidencialitat -
A comparison of different optimisation search methodologies for self-optimisation in wireless cellular networks
(Institute of Electrical and Electronics Engineers (IEEE), 2013)
Text en actes de congrés
Accés restringit per política de l'editorialSelf-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 computational approach for finding 6-List-critical graphs on the Torus
(Universitat Politècnica de Catalunya, 2023-05-26)
Treball Final de Grau
Accés obert
Realitzat a/amb: Univerzita KarlovaLa coloració de grafs dibuixats a superfícies és un àrea antiga i molt estudiada de la teoria de grafs. Thomassen va demostrar que hi ha un nombre finit de grafs 6-crítics a qualsevol superfície fixa i va proporcionar el ... -
A contribution on adaptive coding strategies over H.F. channels
(1989)
Text en actes de congrés
Accés obertWe 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
(2014-09-01)
Article
Accés restringit per política de l'editorialCognitive 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
(1987-06)
Article
Accés restringit per política de l'editorialThis 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
(2016)
Text en actes de congrés
Accés restringit per política de l'editorialIn 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
(Institute of Electrical and Electronics Engineers (IEEE), 2016)
Text en actes de congrés
Accés restringit per política de l'editorialA 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
(1994)
Text en actes de congrés
Accés obertThis 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
(Universitat Politècnica de Catalunya, 2019-10-16)
Projecte Final de Màster Oficial
Accés obert
Realitzat a/amb: Università degli studi di TrentoIn 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
(Universitat Politècnica de Catalunya, 2013-12-13)
Projecte Final de Màster Oficial
Accés obert[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
(Institute of Electrical and Electronics Engineers (IEEE), 1998)
Text en actes de congrés
Accés obertThe 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
(Universitat Politècnica de Catalunya, 2017-05)
Treball Final de Grau
Accés obert
Realitzat a/amb: Massachusetts Institute of TechnologyHogan 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
(Universitat Politècnica de Catalunya, 2017-06-29)
Treball Final de Grau
Accés restringit per acord de confidencialitat -
A multi-objective genetic algorithm to find active modules in multiplex biological networks
(Public Library of Science (PLoS), 2021)
Article
Accés obertThe identification of subnetworks of interest—or active modules—by integrating biological networks with molecular profiles is a key resource to inform on the processes perturbed in different cellular conditions. We here ... -
A multiobjective GRASP for the 1/3 variant of the time and space assembly line balancing problem
(Springer Verlag, 2010-06-01)
Capítol de llibre
Accés restringit per política de l'editorialTime 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 network algorithm for exact tests for Hardy-Weinberg equilibrium with X-chromosomal variants
(Universitat Politècnica de Catalunya, 2020-07)
Projecte Final de Màster Oficial
Accés restringit per acord de confidencialitat