17049 search results - page 3138 / 3410 » cans 2007 |
190
click to vote
APPROX
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
185
click to vote
ASIACRYPT
2007
Springer
16 years 25 days ago
2007
Springer
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
190
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
181
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
Reinforcement learning is a popular and successful framework for many agent-related problems because only limited environmental feedback is necessary for learning. While many algo...
194
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...