Sciweavers

9997 search results - page 273 / 2000
» The case for crowd computing
Sort
View
APNOMS
2006
Springer
15 years 10 months ago
On the Security of Attribute Certificate Structuring for Highly Distributed Computing Environments
For an efficient role based access control using attribute certificate in highly distributed computing environments, we use a technique of structuring role specification certificat...
Soomi Yang
ATAL
2006
Springer
15 years 10 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»
15 years 10 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
WSC
2008
15 years 9 months ago
Comparing designs for computer simulation experiments
The use of simulation as a modeling and analysis tool is wide spread. Simulation is an enabling tool for experimenting virtually on a validated computer environment. Often the und...
Rachel T. Johnson, Bradley Jones, John W. Fowler, ...
COCOON
2008
Springer
15 years 8 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen