6514 search results - page 875 / 1303 » Low-Knowledge Algorithm Control |
146
click to vote
ICIAP
2009
ACM
15 years 8 months ago
2009
ACM
This paper presents a framework for using high-level visual information to enhance the performance of automatic color constancy algorithms. The approach is based on recognizing spe...
139
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
154
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
127
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
175
click to vote
ASAP
1997
IEEE
15 years 8 months ago
1997
IEEE
Improvements in semiconductor integration density and the resulting problem of having to manage designs of increasing complexity is an old one, but still current. The new challeng...