975 search results - page 72 / 195 » Locality Optimization for Program Instances |
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
This contribution is the first to discover exploitable structural features within circuit optimization problems (COP) and discuss how it is indicative of a general structure and ...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...