Mostrando 6 resultados de: 6
Filtros aplicados
Publisher
Expert Systems with Applications(1)
Journal of Applied Mathematics(1)
Journal of Computer and System Sciences(1)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(1)
Proceedings - 2011 IEEE International Symposium on Network Computing and Applications, NCA 2011(1)
Área temáticas
Ciencias de la computación(5)
Física aplicada(2)
El proceso político(1)
Métodos informáticos especiales(1)
Programación informática, programas, datos, seguridad(1)
Origen
scopus(6)
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: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 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: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: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:scopusSLBN: A scalable max-min fair algorithm for rate-based explicit congestion control
Conference ObjectAbstract: The growth of the Internet has increased the need for scalable congestion control mechanisms in highPalabras claves:control congestion, distributed algorithm, max-min fairnessAutores:Fernández Anta A., José Luis López-Presa, Mozo Velasco A.Fuentes:scopus