4940 search results - page 551 / 988 » On the Complexity of Universal Programs |
156
Voted
ECAL
1995
Springer
15 years 10 months ago
1995
Springer
We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by...
172
click to vote
NGITS
1995
Springer
15 years 10 months ago
1995
Springer
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
144
click to vote
WIA
1997
Springer
15 years 10 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
207
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Grids are very complex and volatile infrastructures that exhibit parallel and distributed characteristics. To harness their complexity as well as the increasing intricacy...
160
click to vote
EMNLP
2008
15 years 8 months ago
2008
The intersection of tree transducer-based translation models with n-gram language models results in huge dynamic programs for machine translation decoding. We propose a multipass,...