1647 search results - page 139 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
135
Voted
EOR
2010
15 years 5 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
146
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
147
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
144
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
173
click to vote
VLSM
2005
Springer
15 years 10 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...