384 search results - page 7 / 77 » Equivalence Relations on Classes of Computable Structures |
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...
RELMICS
1998
Springer
15 years 1 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
JUCS
2010
14 years 4 months ago
2010
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
GRC
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-graine...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...