908 search results - page 157 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
111
click to vote
NECO
2008
15 years 1 months ago
2008
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
118
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
109
Voted
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
107
Voted
UAI
1990
15 years 3 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
106
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...