4066 search results - page 101 / 814 » Almost Complete Sets |
191
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
It seems that a suitably constructed fuzzy sets of natural numbers form the most complete and adequate description of cardinality of finite fuzzy sets.(see [11]) Nevertheless, in...
215
click to vote
AI
2004
Springer
15 years 6 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
203
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
176
click to vote
LPNMR
2007
Springer
2007
Springer
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
16 years 14 days ago
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
168
click to vote
GBRPR
2005
Springer
15 years 12 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...