Sciweavers

5114 search results - page 295 / 1023
» Complex networks
Sort
View
IWQOS
2004
Springer
15 years 12 months ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 5 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
16 years 1 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
COR
2008
131views more  COR 2008»
15 years 5 months ago
Queueing analysis of a server node in transaction processing middleware systems
Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we p...
Wei Xiong, Tayfur Altiok