2957 search results - page 246 / 592 » The Complexity of Polynomial-Time Approximation |
176
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
201
click to vote
NIPS
2008
15 years 8 months ago
2008
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...
175
click to vote
IJCAI
1993
15 years 8 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
194
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
200
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...