Results 11 - 20
of
46
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork
- CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract
-
Cited by 119 (10 self)
- Add to MetaCart
was first used by Joux Decision Linear: The Linear assumption was first proposed by Boneh, Boyen, and Shacham for group signatures "Hard" means algorithmically non-solvable with probability 1 /2 + Ω(poly(Σ) −1 ) in time O(poly(Σ)) for efficiently generated random "bilinear instances
Mathematics and Engineering Methods in Computer Science (MEMICS’09), and [8], appeared in the 3-rd Workshop of the ESF Networking Programme on Games for Design and Verification (GAMES’09).
, 2010
"... Abstract In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorit ..."
Abstract
- Add to MetaCart
Abstract In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial
Design and Implementation for an Android based Massively Multiplayer Online Augmented Reality Game Entwurf und Implementierung für ein Android basiertes Massively Multiplayer Online Augmented Reality Game
, 2014
"... Hiermit versichere ich, die vorliegende Master-Thesis ohne Hilfe Dritter nur mit den an-gegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbeh ..."
Abstract
- Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 28th February 2014 (Denis Lapiner) This Master’s Thesis proposes and implements a game design for an Android based massively multiplayer online augmented reality game. The proposed game design is based on an analysis of other popular aug-mented reality games
The agencies method for coalition formation in experimental games
"... In society, power is often transferred to another person or group. A previous work studied the evolution of cooperation among robot players through a coalition formation game with a noncooperative procedure of acceptance of an agency of another player. Motivated by this previous work, we conduct a ..."
Abstract
- Add to MetaCart
laboratory experiment on finitely repeated three-person coalition formation games. Human players with different strength according to the coalition payoffs can accept a transfer of power to another player, the agent, who then distributes the coalition payoffs. We find that the agencies method for coalition
Gameplay-Entwurf und-Implementierung für ein Massively Multiplayer Online Game
"... Hiermit versichere ich, die vorliegende Bachelor-Thesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbe ..."
Abstract
- Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 30th March 2011 Massively multiplayer online games (MMOGs) are very popular nowadays, but mostly still are implemented in a client-server based approach. This thesis is part of a study on the question: Are peer-to-peer networks suitable for real time applications like
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON SMART GRID 1 Shapley Value Estimation for Compensation of Participants in Demand Response
"... Abstract—Designing fair compensation mechanisms for demand response (DR) is challenging. This paper models the problem in a game theoretic setting and designs a payment distribution mechanism based on the Shapley value (SV). As exact computation of the SV is in general intractable, we pro-pose estim ..."
Abstract
- Add to MetaCart
Abstract—Designing fair compensation mechanisms for demand response (DR) is challenging. This paper models the problem in a game theoretic setting and designs a payment distribution mechanism based on the Shapley value (SV). As exact computation of the SV is in general intractable, we pro
ANY-TIME FUZZY CONTROLLER
, 2006
"... Fuzzy logic has been successfully applied in various fields. However, as fuzzy controllers increase in size and complexity, the number of control rules increases exponentially and real-time behavior becomes more difficult. This thesis introduces an any-time fuzzy controller. Much work has been done ..."
Abstract
- Add to MetaCart
Fuzzy logic has been successfully applied in various fields. However, as fuzzy controllers increase in size and complexity, the number of control rules increases exponentially and real-time behavior becomes more difficult. This thesis introduces an any-time fuzzy controller. Much work has been done
Databases and
"... In this demo we present a testbed environment for Peerto-Peer (P2P) game architectures. It is based on Planet PI4, an online multiplayer game whose gameplay provides a standard workload for a set of gaming-specific network interfaces. Its pluggable architecture allows for the evaluation and comparis ..."
Abstract
- Add to MetaCart
In this demo we present a testbed environment for Peerto-Peer (P2P) game architectures. It is based on Planet PI4, an online multiplayer game whose gameplay provides a standard workload for a set of gaming-specific network interfaces. Its pluggable architecture allows for the evaluation
Research Article Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks
"... In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer.We considerMAC protocols for DynWANs that need to be autonomous and robust as well ..."
Abstract
- Add to MetaCart
of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our
Research Article Self-Stabilizing TDMA Algorithms for Dynamic Wireless
"... This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in: ..."
Abstract
- Add to MetaCart
This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in:
Results 11 - 20
of
46