6894 search results - page 307 / 1379 » Generation Problems |
177
click to vote
AIPS
2006
15 years 8 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
163
click to vote
WIA
2007
Springer
16 years 24 days ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
179
click to vote
FLAIRS
2001
15 years 8 months ago
2001
In this paper, we argue that KBS validation should not be limited to testing functional properties of the system, such as its input - output behavior, but must also address its dy...
188
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
172
click to vote
IJCNN
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...