2084 search results - page 387 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
139
click to vote
SWAT
1992
Springer
15 years 6 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
119
Voted
AAAI
2007
15 years 4 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
153
Voted
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
138
click to vote
EMSOFT
2010
Springer
15 years 15 days ago
2010
Springer
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
151
Voted
MOBIDE
2005
ACM
15 years 8 months ago
2005
ACM
The emergence of third-generation (3G) mobile networks offers new opportunities for the effective delivery of data with rich content including multimedia messaging and video-strea...