1391 search results - page 217 / 279 » Completeness of Neighbourhood Logic |
127
click to vote
INFORMATICALT
2007
15 years 6 months ago
2007
Abstract. In this paper an exact and complete analysis of the Lloyd–Max’s algorithm and its initialization is carried out. An effective method for initialization of Lloyd–Max...
JSYML
2007
15 years 6 months ago
2007
We observe that the W∗ -hierarchy, a variant (introduced by Downey, Fellows, and Taylor [8]) of the better known W-hierarchy, coincides with the W-hierarchy, though not level wi...
155
click to vote
DAM
2002
15 years 6 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
179
click to vote
SPLC
2010
15 years 4 months ago
2010
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
199
click to vote
FLAIRS
2009
15 years 4 months ago
2009
Ensuring the consistency and completeness of Semantic Web ontologies is practically impossible, because of their scale and highly dynamic nature. Many web applications, therefore,...