72 search results - page 7 / 15 » Colour Naming considering the Colour Variability Problem |
ECAI
2004
Springer
15 years 4 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
91
Voted
SODA
2000
ACM
15 years 8 days ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
80
Voted
IJCAI
1989
15 years 3 days ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
81
Voted
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
96
Voted
CVPR
2008
IEEE
16 years 28 days ago
2008
IEEE
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...