2356 search results - page 61 / 472 » Characterizations of postman sets |
165
click to vote
DM
2011
14 years 11 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
135
click to vote
SIAMCO
2010
14 years 10 months ago
2010
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
126
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
159
click to vote
ACM
1995
15 years 7 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...
107
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...