494 search results - page 42 / 99 » Heap Building Bounds |
110
click to vote
QUESTA
2010
14 years 5 months ago
2010
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load bala...
DAC
2011
ACM
13 years 10 months ago
2011
ACM
Memory consistency litmus tests are small parallel programs that are designed to illustrate subtle differences between memory consistency models by exhibiting different outcomes...
PODC
2004
ACM
15 years 4 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
FAABS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
218
click to vote
VLDB
2002
ACM
15 years 11 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...