Exploració per tema "Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat"
Ara es mostren els items 1-20 de 313
-
2-D Tucker is PPA complete
(2020-03)
Article
Accés obertThe 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker for all k≥2. This corrects a claim in the literature that the Tucker search ... -
A biased random key genetic algorithm for the weighted independent domination problem
(Association for Computing Machinery (ACM), 2019)
Comunicació de congrés
Accés obertThis work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed ... -
A brief survey on hybrid metaheuristics
(2010)
Text en actes de congrés
Accés restringit per política de l'editorialThe combination of components from different algorithms is currently one of most successful trends in optimization. The hybridization of metaheuristics, such as ant colony optimization, evolutionary algorithms, and variable ... -
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
(2018-06)
Article
Accés obertThis paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted ... -
A correction on Shiloach's algorithm for minimum linear arrangement of trees
(2017-06-29)
Article
Accés obertMore than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on ... -
A count invariant for Lambek calculus with additives and bracket modalities
(Springer-Verlag Berlin Heidelberg, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialThe count invariance of van Benthem (1991) is that for a sequent to be a theorem of the Lambek calculus, for each atom, the number of positive occurrences equals the number of negative occurrences. (The same is true ... -
A GA(TS) hybrid algorithm for scheduling in computational grids
(Springer, 2009)
Text en actes de congrés
Accés obertThe hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In this paper we present a hybridization of ... -
A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
(2020-01-01)
Article
Accés obertA novel algorithm for computing the action of a matrix exponential over a vector is proposed. The algorithm is based on a multilevel Monte Carlo method, and the vector solution is computed probabilistically generating ... -
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(Institute of Electrical and Electronics Engineers (IEEE), 2017)
Comunicació de congrés
Accés obertThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ... -
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(2017)
Report de recerca
Accés obertThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of arc-annotated ... -
A hybrid metaheuristic for the longest common subsequence problem
(2010-10)
Article
Accés restringit per política de l'editorialThe longest common subsequence problem is a classical string problem. It has applications, for example, in pattern recognition and bioinformatics. This contribution proposes an integrative hybrid metaheuristic for this ... -
A mathematical formulation of the loop pipelining problem
(Universitat Politècnica de Catalunya (UPC), 1996)
Text en actes de congrés
Accés obertThis paper presents a mathematical model for the loop pipelining problem that considers several parameters for optimization and supports any combination of resource and timing constraints. The unrolling degree of the loop ... -
A native tensor-vector multiplication algorithm for high performance computing
(2022-12-01)
Article
Accés obertTensor computations are important mathematical operations for applications that rely on multidimensional data. The tensor-vector multiplication (TVM) is the most memory-bound tensor contraction in this class of operations. ... -
A note on the subgraphs of the (2×\infty)-grid
(2010-02)
Article
Accés restringit per política de l'editorialWe 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. -
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
(Association for Computing Machinery (ACM), 2018)
Text en actes de congrés
Accés obertThe complexity of the parameterized halting problem for nondeterministic Turing machines p-Halt is known to be related to the question of whether there are logics capturing various complexity classes [10]. Among others, ... -
A randomized iterated greedy algorithm for the founder sequence reconstruction problem
(2010-04)
Article
Accés restringit per política de l'editorialThe problem of inferring ancestral genetic information in terms of a set of founders of a given population arises in various biological contexts. In optimization terms, this problem can be formulated as a combinatorial ... -
A study of Deep Learning techniques for sequence-based problems
(Universitat Politècnica de Catalunya, 2021-10)
Projecte Final de Màster Oficial
Accés restringit per decisió de l'autorTransformer Networks are a new type of Deep Learning architecture first introduced in 2017. By only applying attention mechanisms, the transformer network can model relations between text sequences that outperformed other ... -
A study of feature selection algorithms for accuracy estimation
(Universitat Politècnica de Catalunya, 2012-09)
Projecte Final de Màster Oficial
Accés obertThe main purpose of Feature Subset Selection is to find a reduced subset of attributes from a data set described by a feature set. The task of a feature selection algorithm (FSA) is to provide with a computational ... -
A Tabu Search algorithm for ground station scheduling problem
(2014)
Text en actes de congrés
Accés obertMission planning plays an important role in satellite control systems. Satellites are not autonomously operated in many cases but are controlled by tele-commands transmitted from ground stations. Therefore, mission scheduling ... -
Accelerating Sequence Alignment Using Processing-In-Memory
(Universitat Politècnica de Catalunya, 2023-10-19)
Projecte Final de Màster Oficial
Accés obertRecent advances in sequencing technologies have made sequencing analysis a fundamental tool for genomics and healthcare research. Before any biological insights can be drawn, sequence data has to be analyzed using complex ...
