2496 search results - page 112 / 500 » On covering by translates of a set |
161
click to vote
RELMICS
1998
Springer
15 years 10 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...
155
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
209
click to vote
ICUMT
2009
15 years 4 months ago
2009
In WSN-based surveillance systems power conservation is an important issue but one must also ensure that the application's objectives are met. In this paper, we jointly addres...
153
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
171
click to vote
JUCS
2002
15 years 6 months ago
2002
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...