Sciweavers

230 search results - page 11 / 46
» Testing Closeness of Discrete Distributions
Sort
View
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
15 years 4 months ago
Cost-Aware Caching Algorithms for Distributed Storage Servers
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang
COMPENG
2010
259views Algorithms» more  COMPENG 2010»
15 years 1 months ago
Propagation of Load Shed in Cascading Line Outages Simulated by OPA
We estimate with a branching process model the propagation of load shed and the probability distribution of load shed in simulated blackouts of an electric power system. The avera...
Janghoon Kim, Ian Dobson
ATAL
2005
Springer
15 years 3 months ago
An agent-based approach for managing symbiotic simulation of semiconductor assembly and test operation
The rapid changing business environment of high-tech asset intensive enterprises such as semiconductor manufacturing constantly drives production managers to look for better solut...
Malcolm Yoke-Hean Low, Kong Wei Lye, Peter Lenderm...
ICA
2007
Springer
15 years 1 months ago
Conjugate Gamma Markov Random Fields for Modelling Nonstationary Sources
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
Ali Taylan Cemgil, Onur Dikmen
ACMSE
2005
ACM
15 years 3 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan