143 search results - page 21 / 29 » Secure Intelligent Agents Based on Formal Description Techni... |
AAAI
1998
13 years 9 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
FAABS
2000
Springer
13 years 11 months ago
2000
Springer
To ful ll the needs of its deep space exploration program, NASAis actively supporting research and development in autonomy software. However, the reliable and cost-e ective develop...
AI
2007
Springer
14 years 2 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...
MAGS
2008
13 years 8 months ago
2008
Process calculi are mathematical tools used for modeling and analyzing the structure and behavior of reactive systems. One such calculus, called APi-calculus (an extension to Pi-ca...