1532 search results - page 60 / 307 » The Symbol Grounding Problem |
140
Voted
IJCAI
2001
15 years 5 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
124
click to vote
IJCAI
1997
15 years 5 months ago
1997
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
113
click to vote
ENTCS
2006
15 years 4 months ago
2006
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
146
click to vote
APN
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
117
click to vote
IJCAI
1989
15 years 5 months ago
1989
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...