SMILE [ 32] is a family of algorithms designed to solve slightly different variants of the structured motif discovery problem on set of input sequences.
The flexibility of the FEATURE framework has proven to be extremely useful for increasing FEATURE's functional coverage and improving not only individual FEATURE models, but also the performance of methods solving slightly different problems, such as loop modeling.
Issues with removing support structures might be solved by slightly changing the design of the internal cooling system.
We design approximation algorithms for min set cover achieving ratios that cannot be achieved in polynomial time (unless problems in NP could be solved by slightly super-polynomial algorithms) with worst-case complexity much lower (though super-polynomial) than those of an exact computation.
Because of its rich, real-time reporting capabilities, SalesVu is trying to solve a slightly different problem than Square or even Intuit's GoPayment.
In [11], the solution to the energy efficiency optimization problem was achieved by solving three slightly tractable subproblems and choosing the best one.
The proposed design consists of a symmetrical venturi tube comprising three pressure sensors and in which flow measurement is obtained by numerically solving a slightly modified version of the unsteady Bernoulli equation.
Our recursive formulas resemble previous formulations [ 6, 9], yet solve a slightly more general variant of the problem (see discussion in Section "A comparison with previous works").
The optimum design problem is solved for a slightly conical shell loaded in external pressure with equidistant ring-stiffeners of a welded square box section.
