3653 search results - page 277 / 731 » On Recognizable Timed Languages |
202
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This paper compares the performance of the program evaluation phase of genetic programming using C and Common Lisp. A simple experiment is conducted, and the conclusion is that ge...
207
click to vote
IJCAI
1993
15 years 8 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
159
click to vote
TREC
1994
15 years 8 months ago
1994
Full-text scanning oers signi cant advantages over other methods of document retrieval but is normally too slow for use on large collections. The Fujitsu AP1000 parallel distribut...
163
click to vote
AI
2007
Springer
15 years 7 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
221
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...