Sciweavers

22 search results - page 3 / 5
» Constraint Satisfaction Problems with Infinite Templates
Sort
View
TPLP
2008
89views more  TPLP 2008»
13 years 5 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
CP
2000
Springer
13 years 9 months ago
A Language for Audiovisual Template Specification and Recognition
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
Jean Carrive, Pierre Roy, François Pachet, ...
JUCS
2006
97views more  JUCS 2006»
13 years 5 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
ASE
1998
81views more  ASE 1998»
13 years 5 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
13 years 11 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson