23413 search results - page 4533 / 4683 » or 2005 |
162
Voted
STACS
2005
Springer
16 years 15 days ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
213
Voted
STACS
2005
Springer
16 years 15 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
244
Voted
STORYTELLING
2005
Springer
16 years 15 days ago
2005
Springer
The goal of this research is to lay the foundations for a formal theory , that abstracts from the procedural and interactive aspects involved in the generation of dramatic content....
188
Voted
STORYTELLING
2005
Springer
16 years 15 days ago
2005
Springer
This paper presents the mechanisms proposed by a generic cognitive architecture for virtual characters with emotional influenced behaviors, called cognitiva, to maintain behavior ...
187
Voted
TABLEAUX
2005
Springer
16 years 15 days ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...