2356 search results - page 56 / 472 » Characterizations of postman sets |
102
click to vote
JMLR
2008
14 years 12 months ago
2008
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
MCSS
2006
Springer
14 years 11 months ago
2006
Springer
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
CSR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
103
click to vote
ECSQARU
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
105
click to vote
AAAI
2008
15 years 2 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...