Sciweavers

105 search results - page 17 / 21
» Writing and Compiling Code into Biochemistry
Sort
View
SCAM
2008
IEEE
15 years 3 months ago
Automatic Determination of May/Must Set Usage in Data-Flow Analysis
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
Andrew Stone, Michelle Strout, Shweta Behere
EMSOFT
2003
Springer
15 years 2 months ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
Emmanuel Agullo, Henricus Bouwmeester, Jack Dongar...
SPE
2008
89views more  SPE 2008»
14 years 9 months ago
The Runabout
This paper presents a variation of the visitor pattern which allows programmers to write visitor-like code in a concise way. The Runabout is a library extension that adds a limited...
Christian Grothoff
RIA
2007
123views more  RIA 2007»
14 years 9 months ago
Continuations pour la programmation de comportement d'agent
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
Denis Jouvin