13376 search results - page 369 / 2676 » Problem Solving with |
151
click to vote
AMAI
1999
Springer
15 years 4 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
136
click to vote
CVPR
2010
IEEE
16 years 4 days ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
138
click to vote
ECCV
2006
Springer
15 years 8 months ago
2006
Springer
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
142
click to vote
ORL
2008
15 years 4 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
161
Voted
PRICAI
1998
Springer
15 years 8 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...