2022 search results - page 226 / 405 » Complexity of Non-Monotonic Logics |
145
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
190
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
149
click to vote
IOLTS
2003
IEEE
15 years 11 months ago
2003
IEEE
The paper describes a specific method for designing selfchecking checkers for m-out-of-n codes. The method is oriented to the Field Programmable Gate Arrays technology and is base...
176
click to vote
IWSOC
2003
IEEE
15 years 11 months ago
2003
IEEE
The new technology of reconfigurable System-on-Chip is shown to be a good match to the requirements of realtime embedded systems. In particular, the judicious use of specialised d...
173
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...