Sciweavers

1204 search results - page 199 / 241
» Termination of Polynomial Programs
Sort
View
RECOMB
2001
Springer
14 years 10 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
IJCAI
1993
13 years 11 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
USENIX
1994
13 years 11 months ago
Acme: A User Interface for Programmers
A hybrid of window system, shell, and editor, Acme gives text-oriented applications a clean, expressive, and consistent style of interaction. Traditional window systems support in...
Rob Pike
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 9 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CI
2000
114views more  CI 2000»
13 years 9 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...