2714 search results - page 269 / 543 » Approximation Schemes for Scheduling |
119
click to vote
WICON
2008
15 years 5 months ago
2008
We present a fluid flow model to analyze backlog-based CSMA policies. The model is obtained using a CSMA fixed point approximation that has been recently proposed and analyzed. We...
130
click to vote
TCS
2010
15 years 2 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
120
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
117
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
164
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many temporal processes can be naturally modeled as a stochastic system that evolves continuously over time. The representation language of continuous-time Bayesian networks allow...