17760 search results - page 86 / 3552 » A Generalization of the Massey-Ding Algorithm |
143
Voted
IPCO
1998
15 years 2 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
104
click to vote
EOR
2008
15 years 1 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
111
click to vote
NA
2008
15 years 1 months ago
2008
In this paper, we propose a segmentation method based on the Generalized Fast Marching Method (GFMM) developed by Carlini et al.([6]). The classical Fast Marching Method (FMM) is a...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
117
click to vote
WABI
2009
Springer
15 years 8 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...