Sciweavers

1151 search results - page 78 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
FASE
2008
Springer
13 years 10 months ago
A Logic of Graph Constraints
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
Fernando Orejas, Hartmut Ehrig, Ulrike Prange
TIME
2002
IEEE
14 years 2 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 8 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
CP
2007
Springer
14 years 3 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Optimization
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
Robert Mateescu, Radu Marinescu 0002, Rina Dechter
COSIT
2009
Springer
125views GIS» more  COSIT 2009»
14 years 1 months ago
Merging Qualitative Constraint Networks Defined on Different Qualitative Formalisms
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...
Jean-François Condotta, Souhila Kaci, Pierr...