Sciweavers

4488 search results - page 326 / 898
» Properties of NP-Complete Sets
Sort
View
FORTE
2003
15 years 8 months ago
Behavioural Contracts for a Sound Assembly of Components
Abstract. Component based design is a new methodology for the construction of distributed systems and applications. In this new setting, a system is built by the assembly of (pre)-...
Cyril Carrez, Alessandro Fantechi, Elie Najm
FORTE
2003
15 years 8 months ago
Concerning the Ordering of Adaptive Test Sequences
Abstract. The testing of a state-based system may involve the application of a number of adaptive test sequences. Where the implementation under test (IUT) is deterministic, the re...
Robert M. Hierons, Hasan Ural
COLING
2000
15 years 8 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 7 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
EJC
2010
15 years 7 months ago
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
Erkko Lehtonen, Jaroslav Nesetril