13376 search results - page 524 / 2676 » Problem Solving with |
190
click to vote
MICAI
2007
Springer
16 years 1 months ago
2007
Springer
This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered appl...
179
Voted
NAACL
2010
15 years 5 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
209
click to vote
EOR
2010
15 years 4 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
183
click to vote
NA
2008
15 years 7 months ago
2008
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
151
Voted
INFORMATICALT
2000
15 years 7 months ago
2000
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...