Sciweavers

1414 search results - page 216 / 283
» Randomness and Universal Machines
Sort
View
COLING
1994
13 years 11 months ago
Parsing Turkish Using The Lexical Functional Grammar Formalism
This paper describes our work on parsing Turkish using the lexical-functional grammar formalism. This work represents the rst e ort for parsing Turkish. Our implementation is based...
Zelal Güngördü, Kemal Oflazer
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 9 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
AI
1998
Springer
13 years 9 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
JUCS
2002
80views more  JUCS 2002»
13 years 9 months ago
On the Power of P Systems with Symport Rules
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...
Carlos Martín-Vide, Andrei Paun, Gheorghe P...
MST
1998
76views more  MST 1998»
13 years 9 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith