272 search results - page 40 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
AIPS
2003
14 years 11 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
110
click to vote
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
113
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...