Sciweavers

15421 search results - page 2676 / 3085
» Dependability
Sort
View
ASIACRYPT
2007
Springer
16 years 1 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
ATAL
2007
Springer
16 years 1 months ago
Distributed management of flexible times schedules
In this paper we consider the problem of managing and exploiting schedules in an uncertain and distributed environment. We assume a team of collaborative agents, each responsible ...
Stephen F. Smith, Anthony Gallagher, Terry L. Zimm...
ATAL
2007
Springer
16 years 1 months ago
Commitment and extortion
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
Paul Harrenstein, Felix Brandt, Felix A. Fischer
ATAL
2007
Springer
16 years 1 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
ATAL
2007
Springer
16 years 1 months ago
Building coalitions involving agents and humans: reports from agent-based participatory simulations
Agent-based participatory simulations are laboratory experiments designed like agent-based simulations and where humans access the simulation as software agents. This paper descri...
Paul Guyot, Shinichi Honiden
« Prev « First page 2676 / 3085 Last » Next »