Sciweavers

1776 search results - page 264 / 356
» Using a Logic Programming Language with Persistence and Cont...
Sort
View
BMCBI
2005
99views more  BMCBI 2005»
13 years 8 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
IFIP
2007
Springer
14 years 3 months ago
Capable Leader and Skilled and Motivated Team Practices to Introduce eXtreme Programming
Abstract. Applying changes to software engineering processes in organisations usually raises many problems of varying nature. Basing on a real-world 2-year project and a simultaneo...
Lech Madeyski, Wojciech Biela
POPL
2005
ACM
14 years 9 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
ILP
1998
Springer
14 years 1 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers