Sciweavers

562 search results - page 85 / 113
» Recent Developments in the Design of Conventional Cryptograp...
Sort
View
150
Voted
ATAL
2007
Springer
15 years 10 months ago
Commitment-driven distributed joint policy search
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...
Stefan J. Witwicki, Edmund H. Durfee
145
Voted
TKDE
2011
168views more  TKDE 2011»
14 years 10 months ago
On Computing Farthest Dominated Locations
—In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p , ...
Hua Lu, Man Lung Yiu
141
Voted
ICIP
2004
IEEE
16 years 5 months ago
Scalable coding of variable size blocks motion vectors
In this paper we discuss an algorithm that is able to provide a scalable (multiresolution) representation of the motion field information. It has been recently demonstrated that, ...
Davide Maestroni, Augusto Sarti, Marco Tagliasacch...
127
Voted
ATAL
2007
Springer
15 years 10 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
129
Voted
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
15 years 10 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama