Sciweavers

5183 search results - page 703 / 1037
» The Complexity of Distributions
Sort
View
ANSS
1996
IEEE
15 years 11 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
HCW
2000
IEEE
15 years 11 months ago
Evaluation of PAMS' Adaptive Management Services
Management of large-scale parallel and distributed applications is an extremely complex task due to factors such as centralized management architectures, lack of coordination and ...
Yoonhee Kim, Salim Hariri, Muhamad Djunaedi
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 6 months ago
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan
EAAI
2007
154views more  EAAI 2007»
15 years 6 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
BMCBI
2005
97views more  BMCBI 2005»
15 years 6 months ago
The yeast kinome displays scale free topology with functional hub clusters
Background: The availability of interaction databases provides an opportunity for researchers to utilize immense amounts of data exclusively in silico. Recently there has been an ...
Robin E. C. Lee, Lynn A. Megeney