1199 search results - page 196 / 240 » Graph Theory |
114
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
101
click to vote
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
104
click to vote
COLT
1993
Springer
15 years 4 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
JSYML
2010
14 years 6 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
112
click to vote
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...