Sciweavers

4895 search results - page 548 / 979
» Functional Quantum Programming
Sort
View
171
Voted
DAC
1999
ACM
16 years 7 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
278
Voted
ASPLOS
2009
ACM
16 years 7 months ago
GPU acceleration of a production molecular docking code
Abstract: Modeling the interactions of biological molecules, or docking, is critical to both understanding basic life processes and to designing new drugs. Here we describe the GPU...
Bharat Sukhwani, Martin C. Herbordt
171
Voted
CVPR
2010
IEEE
16 years 2 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
199
Voted
FLOPS
2010
Springer
16 years 1 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
179
Voted
ISPASS
2009
IEEE
16 years 1 months ago
Experiment flows and microbenchmarks for reverse engineering of branch predictor structures
Insights into branch predictor organization and operation can be used in architecture-aware compiler optimizations to improve program performance. Unfortunately, such details are ...
Vladimir Uzelac, Aleksandar Milenkovic