57 search results - page 6 / 12 » birthday 2009 |
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
BIRTHDAY
2009
Springer
14 years 11 months ago
2009
Springer
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
BIRTHDAY
2009
Springer
14 years 11 months ago
2009
Springer
ProB is an animation and model checking tool for the B Method, which can deal with many interesting specifications. Some specifications, however, contain complicated functions whic...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
Conversational dialogue systems cannot be evaluated in a fully formal manner, because dialogue is heavily dependent on context and current dialogue theory is not precise enough to ...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. T...