Sciweavers

7504 search results - page 177 / 1501
» Computing with Action Potentials
Sort
View
ATAL
2006
Springer
13 years 12 months ago
A technique for reducing normal-form games to compute a Nash equilibrium
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
Vincent Conitzer, Tuomas Sandholm
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
13 years 11 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
MOC
2002
103views more  MOC 2002»
13 years 7 months ago
A computational approach to Hilbert modular group fixed points
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
Jesse Ira Deutsch
PERCOM
2007
ACM
14 years 7 months ago
Distributed, Uncertainty-Aware Access Control for Pervasive Computing
Access control to sensitive resources in pervasive computing needs to take uncertainty into account. Previous research has developed uncertainty-aware access-control models for en...
Urs Hengartner, Ge Zhong
NSPW
2004
ACM
14 years 1 months ago
Symmetric behavior-based trust: a new paradigm for internet computing
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
Vivek Haldar, Michael Franz