2022 search results - page 231 / 405 » Complexity of Non-Monotonic Logics |
177
click to vote
ENTCS
2006
15 years 6 months ago
2006
In the domain of embedded software systems the increasing complexity of the functionality as well as the increase in variations caused by product lines requires a modular design p...
160
click to vote
INTEGRATION
2008
15 years 6 months ago
2008
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
118
click to vote
JSYML
2006
15 years 6 months ago
2006
We investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence rela...
182
click to vote
IAT
2010
IEEE
15 years 4 months ago
2010
IEEE
As wireless sensor network applications grow in complexity, ad-hoc techniques are no longer adequate. Thus, it is crucial that these systems be adaptive and autonomous to remain f...
159
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...