Sciweavers

1392 search results - page 248 / 279
» Staging generic programming
Sort
View
PLDI
2004
ACM
14 years 1 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
ORL
2006
105views more  ORL 2006»
13 years 7 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
POPL
2012
ACM
12 years 3 months ago
Static and user-extensible proof checking
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
Antonis Stampoulis, Zhong Shao
ICFP
2008
ACM
14 years 7 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig