1943 search results - page 129 / 389 » Ordering Default Theories |
221
click to vote
ACM
1995
15 years 10 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
185
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
178
click to vote
TCS
2010
15 years 5 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
184
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
155
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...