Sciweavers

7758 search results - page 243 / 1552
» On the Number of Distributive Lattices
Sort
View
EOR
2007
66views more  EOR 2007»
15 years 6 months ago
Analysis of the queue-length distribution for the discrete-time batch-service Geo
In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and s...
Xeung W. Yi, Nam K. Kim, Bong K. Yoon, Kyung C. Ch...
KER
2006
107views more  KER 2006»
15 years 6 months ago
Partitioning strategies for distributed association rule mining
In this paper a number of alternative strategies for distributed/parallel association rule mining are investigated. The methods examined make use of a data structure, the T-tree, ...
Frans Coenen, Paul H. Leng
ACTA
2005
104views more  ACTA 2005»
15 years 6 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
JMLR
2002
140views more  JMLR 2002»
15 years 6 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
SIMPRA
1998
99views more  SIMPRA 1998»
15 years 6 months ago
Rollback overhead reduction methods for time warp distributed simulation
Parallel discrete event simulation is a useful technique to improve performance of sequential discrete event simulation. We consider the Time Warp algorithm for asynchronous distr...
Simonetta Balsamo, C. Manconi