1912 search results - page 297 / 383 » GOAL as a Planning Formalism |
171
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
166
click to vote
AAAI
2010
15 years 7 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
147
click to vote
UAI
2008
15 years 7 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
170
click to vote
AAAI
2006
15 years 7 months ago
2006
Partially observed actions are observations of action executions in which we are uncertain about the identity of objects, agents, or locations involved in the actions (e.g., we kn...
142
click to vote
IADIS
2004
15 years 7 months ago
2004
This paper outlines new perspectives on the teaching and learning of software systems development in large groups based on a newly designed, final year, Software Systems Analysis ...