Mostrando 8 resultados de: 8
Filtros aplicados
Publisher
Expert Systems with Applications(1)
Journal of Applied Mathematics(1)
Journal of Computer Science and Technology(1)
Journal of Systems and Software(1)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(1)
Área temáticas
Ciencias de la computación(7)
Física aplicada(2)
El proceso político(1)
Métodos informáticos especiales(1)
Programación informática, programas, datos, seguridad(1)
Área de conocimiento
Teoría de grafos(2)
Ciencias de la computación(1)
Optimización matemática(1)
Red informática(1)
Origen
scopus(8)
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:scopusA methodological construction of an efficient sequential consistency protocol
Conference ObjectAbstract: A concurrent object is an object that can be concurrently accessed by several processes. SequentialPalabras claves:Autores:Cholvi V., Ernesto Jiménez, Fernández Anta A., Raynal M.Fuentes:scopusA parametrized algorithm that implements sequential, causal, and cache memory consistencies
ArticleAbstract: In this paper, we present an algorithm that can be used to implement sequential, causal, or cache coPalabras claves:Causal consistency, Coherency models, distributed shared memory, DISTRIBUTED SYSTEMS, Sequential consistencyAutores:Cholvi V., Ernesto Jiménez, Fernández Anta A.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:scopusEventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony
ArticleAbstract: his paper considers the eventual leader election problem in asynchronous message-passing systems whePalabras claves:Eventual leader election, eventually timely and fair lossy links, failure detector, omega leader oracle, process initial knowledgeAutores:Ernesto Jiménez, Fernández Anta A., Raynal M.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: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