Sciweavers

953 search results - page 27 / 191
» Constraint Based Transformation Theory
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 2 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 11 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICTAI
2003
IEEE
15 years 7 months ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen
SMI
2010
IEEE
165views Image Analysis» more  SMI 2010»
14 years 11 months ago
Designing a Topological Modeler Kernel: A Rule-Based Approach
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
Thomas Bellet, Mathieu Poudret, Agnès Arnou...
ENTCS
2007
84views more  ENTCS 2007»
15 years 1 months ago
A Rewriting Logic Framework for Soft Constraints
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
Martin Wirsing, Grit Denker, Carolyn L. Talcott, A...