Sciweavers

3270 search results - page 602 / 654
» Approximate String Processing
Sort
View
COMCOM
2008
127views more  COMCOM 2008»
13 years 7 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan
DT
2006
98views more  DT 2006»
13 years 7 months ago
Handling variations and uncertainties
The widely used engineering decisions concerning the performance of technological equipment for process industries are usually deterministic. Since the early 1990s probabilistic m...
Tim Cheng
BMCBI
2007
106views more  BMCBI 2007»
13 years 7 months ago
Modeling SAGE tag formation and its effects on data interpretation within a Bayesian framework
Background: Serial Analysis of Gene Expression (SAGE) is a high-throughput method for inferring mRNA expression levels from the experimentally generated sequence based tags. Stand...
Michael A. Gilchrist, Hong Qin, Russell L. Zaretzk...
EOR
2006
107views more  EOR 2006»
13 years 7 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...