1912 search results - page 103 / 383 » GOAL as a Planning Formalism |
164
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—We propose a formal model of web security based straction of the web platform and use this model to analyze the security of several sample web mechanisms and applications. We id...
163
click to vote
FASE
2000
Springer
15 years 10 months ago
2000
Springer
The problem of consistently engineering large, complex software systems of today is often addressed by introducing new, "improved" models. Examples of such models are arc...
144
click to vote
JFP
2010
15 years 4 months ago
2010
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
158
click to vote
NIPS
1993
15 years 7 months ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...
169
click to vote
AGTIVE
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...