4597 search results - page 199 / 920 » The Spider Model of Agents |
164
click to vote
WOA
2000
15 years 8 months ago
2000
The computer simulation of complex phenomena is a challenging issue for studying their properties. Several models and techniques have been developed in order to provide useful con...
163
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
155
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
166
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Most current crowd simulators animate homogeneous crowds, but include underlying parameters that can be tuned to create variations within the crowd. These parameters, however, are...
176
click to vote
AAAI
1990
15 years 7 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...