Sciweavers

228 search results - page 41 / 46
» Expected Reachability-Time Games
Sort
View
AAMAS
2007
Springer
13 years 7 months ago
Generalized multiagent learning with performance bound
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
Bikramjit Banerjee, Jing Peng
OTM
2010
Springer
13 years 5 months ago
Context-Aware Tuples for the Ambient
In tuple space approaches to context-aware mobile systems, the notion of context is defined by the presence or absence of certain tuples in the tuple space. Existing approaches de...
Christophe Scholliers, Elisa Gonzalez Boix, Wolfga...
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
14 years 7 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
ALT
2009
Springer
14 years 4 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CRYPTO
2009
Springer
172views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
We present a new methodology for proving security of encryption systems using what we call Dual System Encryption. Our techniques result in fully secure Identity-Based Encryption ...
Brent Waters