4488 search results - page 79 / 898 » Properties of NP-Complete Sets |
RSFDGRC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
PODS
1991
ACM
13 years 11 months ago
1991
ACM
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We here address the problem of constructing sets of sequences with low integrated aperiodic auto- and crosscorrelations when the constraint of antipodal symbols is enforced. Our m...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...