Sciweavers

1204 search results - page 48 / 241
» Termination of Polynomial Programs
Sort
View
JCT
2000
103views more  JCT 2000»
13 years 10 months 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
ICDCS
1998
IEEE
14 years 3 months ago
Accelerated Heartbeat Protocols
Heartbeat protocols are used by distributed programs to ensure that if a process in a program terminates or fails, then the remaining processes in the program terminate. We presen...
Mohamed G. Gouda, Tommy M. McGuire
EUROGP
2005
Springer
14 years 4 months ago
Understanding Evolved Genetic Programs for a Real World Object Detection Problem
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
Victor Ciesielski, Andrew Innes, Sabu John, John M...
WLP
1997
Springer
14 years 3 months ago
Extending Homeomorphic Embedding in the Context of Logic Programming
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
Michael Leuschel
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 2 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...