Sciweavers

2091 search results - page 416 / 419
» Modelling adaptive services for distributed systems
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 8 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SIGIR
2011
ACM
12 years 10 months ago
The economics in interactive information retrieval
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
Leif Azzopardi
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
NETGAMES
2004
ACM
14 years 1 months ago
Lightweight QoS-support for networked mobile gaming
In this paper, we present an approach to provide Quality of Service (QoS) for networked mobile gaming. In order to examine the QoS requirements of mobile games, we ported a simple...
Marcel Busse, Bernd Lamparter, Martin Mauve, Wolfg...
AI
2002
Springer
13 years 7 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...