2593 search results - page 134 / 519 » constraints 2007 |
110
click to vote
APBC
2007
15 years 8 months ago
2007
real or abstract. It provides a widely applicable approach to the prediction of compensatory substitutions for CPDs, avoiding any reliance on rigid non-probabilistic criteria or st...
159
click to vote
IJCAI
2007
15 years 8 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
178
click to vote
MVA
2000
15 years 7 months ago
2000
IAPR Workshop on Machine Vision and Applications, pp. 455-458, 2000, Tokyo, Japan In this paper, we integrate the model-based tracking and local contexture (temporal and spatial) ...
146
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
160
click to vote
SARA
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...