Mostrando 10 resultados de: 17
Publisher
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(3)
Computing(2)
Discrete Applied Mathematics(1)
Expert Systems with Applications(1)
ICCRD2011 - 2011 3rd International Conference on Computer Research and Development(1)
Área temáticas
Ciencias de la computación(15)
Física aplicada(4)
Métodos informáticos especiales(2)
Programación informática, programas, datos, seguridad(2)
Economía(1)
B-Neck: A distributed and quiescent max-min fair algorithm
Conference ObjectAbstract: The problem of fairly distributing the capacity of a network among a set of sessions has been widelyPalabras claves:distributed algorithm, Max-mix fairness, QuiescenceAutores:Fernández Anta A., José Luis López-Presa, Mozo Velasco A.Fuentes:scopusBiased selection for building small-world networks
Conference ObjectAbstract: Small-world networks are currently present in many distributed applications and can be built augmentPalabras claves:Autores:Fernández Anta A., José Luis López-Presa, Lorenzo M.A., Manzano P., Mozo Velasco A., Sevilla A.Fuentes:scopusA distributed and quiescent max-min fair algorithm for network congestion control
ArticleAbstract: Given the higher demands in network bandwidth and speed that the Internet will have to meet in the nPalabras claves:Distributed Optimization, Max-min fair, Network congestion control, Proactive algorithm, Quiescent algorithmAutores:Fernández Anta A., José Luis López-Presa, Mozo Velasco A.Fuentes:scopusConsensus in anonymous asynchronous systems with crash-recovery and omission failures
ArticleAbstract: In anonymous distributed systems, processes are indistinguishable because they have no identity andPalabras claves:anonymity, Anonymous omega, Asynchrony, consensus, Crash-recovery failures, Failure Detectors, Omission failuresAutores:Ernesto Jiménez, José Luis López-Presa, Patiño-Martínez M.Fuentes:scopusConsensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
ArticleAbstract: We study consensus in asynchronous systems where membership is unknown, and where up to f degeneratiPalabras claves:Byzantine failures, consensus, distributed algorithms, Omega failure detector, Unknown membershipAutores:Ernesto Jiménez, José Luis López-Presa, Martin-Rueda J.Fuentes:scopusContainment properties of product and power graphs
ArticleAbstract: In this paper, we study containment properties of graphs in relation with the Cartesian product operPalabras claves:Cartesian product, embedding, Interconnection networks, isomorphism, Power graphs, Product graphs, SubgraphAutores:Fernández Anta A., José Luis López-Presa, Leighton T.Fuentes:scopusFast algorithm for graph isomorphism testing
Conference ObjectAbstract: In this paper we present a novel approach to the graph isomorphism problem. We combine a direct apprPalabras claves:Autores:Fernández Anta A., José Luis López-PresaFuentes:scopusFollowing Leaders in Byzantine Multirobot Systems by Using Blockchain Technology
ArticleAbstract: Interest in multirobot systems is rising rapidly both in academia and in industry. The use of multipPalabras claves:Blockchain-aided robotics, byzantine fault-tolerance, DISTRIBUTED SYSTEMS, multirobot systems, resilient robotics, verifiable roboticsAutores:Ernesto Jiménez, Ferrer E.C., José Luis López-Presa, Martin-Rueda J.Fuentes:scopusNovel Techniques to Speed Up the Computation of the Automorphism Group of a Graph
ArticleAbstract: Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphisPalabras claves:Autores:Chiroque L.N., Fernández Anta A., José Luis López-PresaFuentes:scopusNovel techniques for automorphism group computation
Conference ObjectAbstract: Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphisPalabras claves:Autores:Chiroque L.N., Fernández Anta A., José Luis López-PresaFuentes:scopus