1242 search results - page 111 / 249 » A Computational Complexity Theory in Membrane Computing |
LATA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
IEEECIT
2010
IEEE
14 years 8 months ago
2010
IEEE
—Database technology is the significant part of computer science and technology, as the core technology of information management, database technology is widely used in the field...
PODC
2009
ACM
15 years 4 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
EUROGP
2009
Springer
15 years 4 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
AGP
1999
IEEE
15 years 2 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...