Sciweavers

7486 search results - page 1126 / 1498
» The Limits of Quantum Computers
Sort
View
GECCO
2009
Springer
15 years 10 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
ASAP
2004
IEEE
127views Hardware» more  ASAP 2004»
15 years 10 months ago
A Public-Key Cryptographic Processor for RSA and ECC
We describe a general-purpose processor architecture for accelerating public-key computations on server systems that demand high performance and flexibility to accommodate large n...
Hans Eberle, Nils Gura, Sheueling Chang Shantz, Vi...
CAV
2004
Springer
108views Hardware» more  CAV 2004»
15 years 10 months ago
Functional Dependency for Verification Reduction
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
Jie-Hong Roland Jiang, Robert K. Brayton
ASPDAC
2006
ACM
141views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Depth-driven verification of simultaneous interfaces
The verification of modern computing systems has grown to dominate the cost of system design, often with limited success as designs continue to be released with latent bugs. This t...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
ATAL
2006
Springer
15 years 10 months ago
Scalable and reliable data delivery in mobile ad hoc sensor networks
This paper studies scalable data delivery algorithms in mobile ad hoc sensor networks with node and link failures. Many algorithms have been developed for data delivery and fusion...
Bin Yu, Paul Scerri, Katia P. Sycara, Yang Xu, Mic...
« Prev « First page 1126 / 1498 Last » Next »