Sciweavers

125 search results - page 6 / 25
» Transforming Normal Programs by Replacement
Sort
View
IJKESDP
2010
60views more  IJKESDP 2010»
13 years 5 months ago
Portfolio selection problems with normal mixture distributions including fuzziness
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
Takashi Hasuike, Hiroaki Ishii
EUROPAR
2007
Springer
13 years 11 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
13 years 11 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
FAC
2010
259views more  FAC 2010»
13 years 6 months ago
An algebraic approach to the design of compilers for object-oriented languages
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio
ALP
1994
Springer
13 years 11 months ago
Logic Programs as term Rewriting Systems
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
Massimo Marchiori