957 search results - page 1 / 192 » Addition Chain Heuristics |
TEC
2008
13 years 7 months ago
2008
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
CRYPTO
1989
Springer
13 years 11 months ago
1989
Springer
AIPS
2008
13 years 10 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
AIPS
2008
13 years 10 months ago
2008
The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
ALENEX
2003
13 years 9 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...