660 search results - page 120 / 132 » Parallel Computer Workload Modeling with Markov Chains |
160
Voted
QEST
2008
IEEE
16 years 22 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
153
Voted
LCN
2006
IEEE
16 years 11 days ago
2006
IEEE
A collision resolution scheme is essential to the performance of a random-access wireless network. Most schemes employ exponential backoff (EB) to adjust the transmission attempt ...
299
click to vote
SADM
2010
15 years 1 months ago
2010
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
197
Voted
BMCBI
2005
15 years 6 months ago
2005
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
158
Voted
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we present a system capable of improving the I/O performance in an automatic way. This system is able to learn the behavior of the applications running on top and ï¬...