3946 search results - page 25 / 790 » The computational complexity of choice sets |
CVIU
2008
14 years 11 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
VIS
2007
IEEE
16 years 1 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
AI
2006
Springer
14 years 11 months ago
2006
Springer
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
ICMAS
2000
15 years 1 months ago
2000
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...
IPL
2006
14 years 11 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...