Sciweavers

1008 search results - page 12 / 202
» Minimizing Average Flow-Time
Sort
View
DMIN
2007
76views Data Mining» more  DMIN 2007»
15 years 1 months ago
Towards Average Case Analysis of Itemset Mining
—We perform a statistical analysis and describe the asymptotic behavior of the frequency and size distribution of δoccurrent, minimal δ-occurrent, and maximal δ-occurrent item...
Dan Singer, David J. Haglin, Anna M. Manning
109
Voted
COR
1999
99views more  COR 1999»
14 years 11 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
92
Voted
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 11 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
82
Voted
TON
2008
76views more  TON 2008»
14 years 11 months ago
Minimizing file download time in stochastic peer-to-peer networks
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show th...
Yuh-Ming Chiu, Do Young Eun
TIP
1998
129views more  TIP 1998»
14 years 11 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po