1139 search results - page 103 / 228 » Bounded Ideation Theory |
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
There is a clear intuitive connection between the notion of leakage of information in a program and concepts from information theory. This intuition has not been satisfactorily pi...
VMCAI
2010
Springer
14 years 6 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
CPAIOR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...