5084 search results - page 50 / 1017 » Proving Possibility Properties |
126
Voted
JSYML
2011
14 years 8 months ago
2011
With every σ-ideal I on a Polish space we associate the σ-ideal I∗ generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals...
157
click to vote
MEMOCODE
2008
IEEE
15 years 12 months ago
2008
IEEE
We present a component-based description language for heterogeneous systems composed of several data flow processing components and a unique eventbased controller. Descriptions a...
174
click to vote
COCOON
2000
Springer
15 years 9 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
128
click to vote
AML
2000
15 years 5 months ago
2000
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
148
click to vote
IWANN
2001
Springer
15 years 10 months ago
2001
Springer
In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation....