Sciweavers

2563 search results - page 181 / 513
» Phenomenology, Representations and Complexity
Sort
View
CP
2007
Springer
15 years 2 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ICCV
1995
IEEE
15 years 1 months ago
FORMS: A Flexible Object Recognition and Modelling System
Abstract. We describe a flexible object recognition and modelling system (FORMS) which represents and recognizes animate objects from their silhouettes. This consists of a model fo...
Song Chun Zhu, Alan L. Yuille
AAAI
2008
15 years 15 days ago
Hypothesis Pruning and Ranking for Large Plan Recognition Problems
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
Gita Sukthankar, Katia P. Sycara
80
Voted
AIPS
2007
15 years 15 days ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
Raghav Aras, Alain Dutech, François Charpil...
DLOG
2007
15 years 15 days ago
Action Based ABox Update: an Example from the Chemical Compound Formulation
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
Alessandro Mosca, Matteo Palmonari