Sciweavers

1552 search results - page 304 / 311
» On the Complexity of Constant Propagation
Sort
View
MANSCI
2008
96views more  MANSCI 2008»
14 years 9 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
MST
2006
136views more  MST 2006»
14 years 9 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
89
Voted
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
BMCBI
2005
127views more  BMCBI 2005»
14 years 9 months ago
Are scale-free networks robust to measurement errors?
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
Nan Lin, Hongyu Zhao
85
Voted
BMCBI
2005
126views more  BMCBI 2005»
14 years 9 months ago
HomoMINT: an inferred human network based on orthology mapping of protein interactions discovered in model organisms
Background: The application of high throughput approaches to the identification of protein interactions has offered for the first time a glimpse of the global interactome of some ...
Maria Persico, Arnaud Ceol, Caius Gavrila, Robert ...