1356 search results - page 170 / 272 » Some New Results on Inverse Sorting Problems |
CP
1995
Springer
14 years 15 days ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
AAAI
2008
13 years 11 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
AAAI
2006
13 years 10 months ago
2006
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
ICCV
2009
IEEE
13 years 6 months ago
2009
IEEE
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
SISAP
2009
IEEE
14 years 3 months ago
2009
IEEE
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...