2543 search results - page 27 / 509 » Optimal Ordered Problem Solver |
109
click to vote
DAC
2001
ACM
16 years 2 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
127
click to vote
AAAI
2008
15 years 4 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
100
Voted
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
ISMVL
2006
IEEE
15 years 8 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
124
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...