Sciweavers

557 search results - page 43 / 112
» Useful Transformations in Answer set programming
Sort
View
APLAS
2009
ACM
14 years 2 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata
BMCBI
2007
148views more  BMCBI 2007»
13 years 8 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
QOSA
2010
Springer
13 years 12 months ago
Evaluating Maintainability with Code Metrics for Model-to-Model Transformations
Using model-to-model transformations to generate analysis models or code from architecture models is sought to promote compliance and reuse of components. The maintainability of tr...
Lucia Kapová, Thomas Goldschmidt, Steffen B...
ICFP
2009
ACM
14 years 8 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky
ICSE
1997
IEEE-ACM
14 years 3 days ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson