Sciweavers

50 search results - page 6 / 10
» Classical Simulation Complexity of Quantum Branching Program...
Sort
View
CSJM
2006
59views more  CSJM 2006»
13 years 7 months ago
Traveling Salesman Problem with Transportation
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...
Valeriu Ungureanu
HICSS
2002
IEEE
95views Biometrics» more  HICSS 2002»
14 years 24 days ago
Simulation Spectrum and Stability Models
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...
Christopher Landauer
RIVF
2007
13 years 9 months ago
Stochastic routing in large grid-shaped quantum networks
— 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...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
IJHPCA
2008
131views more  IJHPCA 2008»
13 years 7 months ago
De Novo Ultrascale Atomistic Simulations On High-End Parallel Supercomputers
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 ...
Aiichiro Nakano, Rajiv K. Kalia, Ken-ichi Nomura, ...
IISWC
2008
IEEE
14 years 2 months ago
Accelerating multi-core processor design space evaluation using automatic multi-threaded workload synthesis
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...
Clay Hughes, Tao Li