Sciweavers

5506 search results - page 79 / 1102
» Minimal Logic Programs
Sort
View
SPIN
2007
Springer
15 years 6 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
87
Voted
ICALP
2001
Springer
15 years 5 months ago
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. S...
84
Voted
APLAS
2007
ACM
15 years 4 months ago
On a Tighter Integration of Functional and Logic Programming
The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: ...
Bernd Braßel, Frank Huch
108
Voted
ECCV
2000
Springer
16 years 2 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
JCT
2000
103views more  JCT 2000»
15 years 17 days ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver