Reports de recerca
Recent Submissions
-
Trees whose even-degree vertices induce a path are antimagic
(2019-05-16)
External research report
Open AccessAn antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels ... -
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(2017)
External research report
Open AccessThe 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 ... -
Refinement by browsing: an alternative to thumbnails
(2005-03)
External research report
Open AccessThumbnails are widely used in image retrieval and browsing systems. The use of such images compacts information. However, in situations where there are a large number of images on a server site, the use of thumbnails may ... -
On Berners-Lee computer, hints on navigability semantics and lack of referential integrity
(2005-03)
External research report
Open AccessIn this paper we deal with semantics issues related to the stability, navigability and extensibility of web applications. To this end, we define a web application as a deterministic labelled transition system in which ... -
A skeleton for the Tabu search metaheuristic with applications to problems in software engineering
(2001-06)
External research report
Open AccessWe present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-known meta-heuristic that has proved successful for sub-optimally solving hard combinatorial optimization problems. Recently ... -
Automatic evaluation of top-down predictive parsing
(2016-04-01)
External research report
Open AccessWe develop efficient methods to check whether two given Context-Free Grammars (CFGs) are transformed into parsers that recognize the same language and construct the same Abstract Syntax Trees (ASTs) for each input. In this ... -
Network creation games: structure vs anarchy
(2017-09-03)
External research report
Open AccessWe study Nash equilibria and the price of anarchy in the classical model of Network Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at a prefixed price a > 0 in order to get connected ... -
Distributed ambient graphs with business configurations
(2018-01-17)
External research report
Open AccessIn this paper we present distributed ambient graphs with business configurations to extend our original model of service oriented computing ($SOC$) with an ambient topology of locations. This ambient topology is based on ... -
Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE
(1984)
External research report
Open AccessWe find sets in the class LOGSPACE (on-line) that do not have good respectively approximations by context-free languages. For that we introduce the languages CF-bi-inmune and CF-levelable. We prove the results by defining ... -
Connections among non uniform models for problems requiring high amount of resources
(1985-11)
External research report
Open AccessWe characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined ... -
Manual de POSTOFF : nueva versión
(1985)
External research report
Open AccessUn programa adaptador de textos para que el formateador DSR Runoff se haga amiguete de la impresora LA100. Documentación correspondiente a la versión 3.0. Creado por José Luis Balcázar en la F.I.B. durante 1984. -
Complements des facteurs gauches de mots infinis et ambiguité : quelques exemples
(1985)
External research report
Open AccessOn se propose d'utiliser la méthode que P. Flajolet a décrit pour prouver l'ambiguité du langage de Goldstine [5], afin de prouver l'ambiguité d'une série de langages du même type. Ces langages sont tous des complémentaires ...
RSS 1.0