Sciweavers

3652 search results - page 301 / 731
» A study of query length
Sort
View
143
Voted
PE
2011
Springer
228views Optimization» more  PE 2011»
14 years 10 months ago
Closed-form waiting time approximations for polling systems
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The present study derives closed-form approximations for the mean waiting t...
Marko A. A. Boon, Erik M. M. Winands, Ivo J. B. F....
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
14 years 10 months ago
Approximation Algorithms for Scheduling Parallel Jobs
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Klaus Jansen, Ralf Thöle
236
Voted
NC
2011
236views Neural Networks» more  NC 2011»
14 years 6 months ago
Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
Hans-Jörg Kreowski, Sabine Kuske
131
Voted
EDBT
2004
ACM
122views Database» more  EDBT 2004»
16 years 3 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
WWW
2010
ACM
15 years 10 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla