Sciweavers

398 search results - page 69 / 80
» Spider Diagrams of Order
Sort
View
ETS
2010
IEEE
150views Hardware» more  ETS 2010»
13 years 11 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...
GG
2008
Springer
13 years 11 months ago
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
Hartmut Ehrig, Ulrike Prange
ECAI
2010
Springer
13 years 10 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 10 months ago
Dynamic System Adaptation by Constraint Orchestration
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
Luuk Groenewegen, Erik P. de Vink
COMBINATORICS
2007
64views more  COMBINATORICS 2007»
13 years 9 months ago
An Analogue of the Thue-Morse Sequence
We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...
Emmanuel Ferrand