1242 search results - page 68 / 249 » A Computational Complexity Theory in Membrane Computing |
143
Voted
COCO
2009
Springer
16 years 17 days ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
181
Voted
MODELS
2007
Springer
16 years 3 days ago
2007
Springer
To promote the Model-Based software engineering development of user interfaces, this paper proposes a model driven development approach of complex user interface. The approach cap...
164
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
176
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
154
Voted
ECML
1993
Springer
15 years 10 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...