16091 search results - page 310 / 3219 » Solving |
136
click to vote
EOR
2006
15 years 6 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
155
click to vote
IJON
2008
15 years 6 months ago
2008
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
118
click to vote
DM
2007
15 years 6 months ago
2007
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
136
click to vote
JPDC
2006
15 years 6 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
200
click to vote
JSS
2006
15 years 6 months ago
2006
Model is a kind of codified knowledge that has been verified in solving problems. Solving a complex problem usually needs a set of models. Using components, the composition of a s...