50 search results - page 6 / 10 » Classical Simulation Complexity of Quantum Branching Program... |
104
Voted
CSJM
2006
14 years 11 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
64
Voted
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...
RIVF
2007
15 years 1 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
129
Voted
IJHPCA
2008
14 years 11 months ago
2008
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
IISWC
2008
IEEE
15 years 6 months ago
2008
IEEE
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...