4940 search results - page 192 / 988 » On the Complexity of Universal Programs |
151
click to vote
NIPS
2003
15 years 7 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
161
click to vote
COGSCI
2004
15 years 6 months ago
2004
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
181
click to vote
DATESO
2009
15 years 4 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
155
click to vote
CSO
2009
IEEE
16 years 1 months ago
2009
IEEE
In order to improve and convey the semantic information perfectly and vividly through synthesized speech, a special prosodic phrasing in broadcasting news programs, namely complex...
168
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...