1041 search results - page 191 / 209 » Randomizing Reductions of Search Problems |
SPAA
2003
ACM
14 years 28 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
GECCO
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
GECCO
2009
Springer
14 years 9 days ago
2009
Springer
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
ICRA
2000
IEEE
14 years 2 days ago
2000
IEEE
This paper addresses the problem of path planning for a class of deformable volumes under fairly general manipulation constraints. The underlying geometric model for the volume is...
EPEW
2008
Springer
13 years 9 months ago
2008
Springer
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...