Sciweavers

3221 search results - page 253 / 645
» Termination of Linear Programs
Sort
View
ISMB
2000
15 years 7 months ago
A Probabilistic Learning Approach to Whole-Genome Operon Prediction
We present a computational approach to predicting operons in the genomes of prokaryotic organisms. Our approach uses machine learning methods to induce predictive models for this ...
Mark Craven, David Page, Jude W. Shavlik, Joseph B...
ENTCS
2008
121views more  ENTCS 2008»
15 years 6 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
PPL
2008
106views more  PPL 2008»
15 years 6 months ago
On Implementing the Farm Skeleton
Algorithmic skeletons intend to simplify parallel programming by providing a higher abstraction compared to the usual message passing. Task and data parallel skeletons can be dist...
Michael Poldner, Herbert Kuchen
TASE
2008
IEEE
15 years 6 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen
CORR
2004
Springer
107views Education» more  CORR 2004»
15 years 6 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune