2563 search results - page 200 / 513 » Phenomenology, Representations and Complexity |
213
click to vote
VISSYM
2004
15 years 8 months ago
2004
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and comple...
162
click to vote
TAPD
1998
15 years 8 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
175
click to vote
UAI
1998
15 years 8 months ago
1998
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
213
click to vote
NIPS
1994
15 years 8 months ago
1994
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
194
click to vote
PSTV
1993
15 years 8 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...