2543 search results - page 53 / 509 » Optimal Ordered Problem Solver |
SAT
2007
Springer
15 years 3 months ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...
FUZZIEEE
2007
IEEE
14 years 11 months ago
2007
IEEE
— In many decision support applications it is important to guarantee the expressive power, easy formalization and interpretability of Mamdani-type fuzzy inference systems (FIS), ...
CP
2001
Springer
15 years 2 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
PAMI
2010
14 years 8 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...