Sciweavers

411 search results - page 8 / 83
» Automating the Dependency Pair Method
Sort
View
KBSE
2000
IEEE
14 years 2 months ago
Systematic Generation of Dependable Change Coordination Plans for Automated Switching of Coordination Policies
Distributed information systems for decision support and e-commerce applications require coordination of multiple autonomous components and their services to accomplish a set of g...
Prasanta K. Bose, Mark G. Matthews
EJASP
2010
158views more  EJASP 2010»
13 years 4 months ago
A Fully Automated Method to Detect and Segment a Manufactured Object in an Underwater Color Image
In this work we propose a fully automated active contours based method for the detection and the segmentation of a moored manufactured object in an underwater image. Detection of o...
Christian Barat, Ronald Robert Phlypo
AAAI
1992
13 years 10 months ago
Automated Model Selection Using Context-Dependent Behaviors
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
P. Pandurang Nayak, Leo Joskowicz, Sanjaya Addanki
LOPSTR
2004
Springer
14 years 3 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
ENTCS
2007
109views more  ENTCS 2007»
13 years 9 months ago
Improving the Context-sensitive Dependency Graph
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
Beatriz Alarcón, Raúl Gutiérr...