Sciweavers

5634 search results - page 120 / 1127
» About Abstract Classes
Sort
View
ICMAS
2000
15 years 14 days ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
AAAI
1992
15 years 9 days ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
KI
2008
Springer
14 years 11 months ago
Collectives and How They Move: A Tale of Two Classifications
Abstract. Collective phenomena and their associated movement patterns are ubiquitous in everyday life. However, even though we need to be able to reason about these phenomena, espe...
Zena Wood, Antony Galton
IJCM
2002
73views more  IJCM 2002»
14 years 11 months ago
Space-Time Equations for Non-Unimodular Mappings
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
Jingling Xue, Patrick M. Lenders
122
Voted
SUM
2010
Springer
14 years 9 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...