6833 search results - page 194 / 1367 » Some two-character sets |
134
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
133
click to vote
DIAGRAMS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Euler diagrams are an effective and intuitive way of representing relationships between sets. As the number of sets represented grows, Euler diagrams can become `cluttere...
138
click to vote
RSCTC
2000
Springer
15 years 8 months ago
2000
Springer
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
126
click to vote
KBSE
1995
IEEE
15 years 8 months ago
1995
IEEE
cation at some level of abstraction, abandoning the semantic information provided by the specification. In this paper, we propose a methodology that ships the overhead of formal re...
135
click to vote
FAW
2008
Springer
15 years 6 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...