29046 search results - page 5568 / 5810 » Computable Models |
222
click to vote
PODC
2006
ACM
16 years 17 days ago
2006
ACM
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
216
click to vote
PODC
2006
ACM
16 years 17 days ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
175
click to vote
SAC
2006
ACM
16 years 17 days ago
2006
ACM
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security co...
161
click to vote
SPAA
2006
ACM
16 years 17 days ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
178
click to vote
WS
2006
ACM
16 years 17 days ago
2006
ACM
The interoperability of IM (Instant Messaging) and SMS (Short Messaging Service) networks allows users to seamlessly use a variety of computing devices from desktops to cellular p...