K Server Problem
Mostrando 1-3 de 3 artigos, teses e dissertações.
-
1. O problema do k-Servidor / The k-server problem
In this work we study the k-server problem. In this problem, we have k servers on a metric space that must attend a sequence of requests with the goal of minimizing the total distance moved by the servers. We dedicate special attention to the k-server conjecture: any metric space allows for a k-competitive k-server algorithm. This is one of the most importan
Publicado em: 2010
-
2. Simulação de filas Gi/G/m e verificação de aproximações destas por filas Ph/Ph/m / GI/G/m queueing simulation and GI/G/m queue approximations for Ph/Ph/m queues
The performance evaluation of a GI/G/m queueing system is a classic hard problem. These multi-server queues are notoriously difficult to be evaluated analytically and, a analytic solutions is possible only for special cases, just as the queues M/M/m, M/D/m, M/K2 /m, GI/H2/m, GI/EK/m, GI/Ph/m, Ph/D/m e Ph/Ph/m. The computer simulation models, despite of requi
Publicado em: 1998
-
3. Phydbac (phylogenomic display of bacterial genes): an interactive resource for the annotation of bacterial genomes
Phydbac is a web interactive resource based on phylogenomic profiling, designed to help microbiologists to annotate bacterial proteins. Phylogenomic annotation is based on the assumption that functionally linked protein-coding genes must evolve in a coordinated manner. The detection of subsets of co-evolving genes within a given genome involves the computati
Oxford University Press.