3433 search results - page 153 / 687 » Heuristics for a bidding problem |
179
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
162
click to vote
ATMOS
2007
15 years 8 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
126
click to vote
COR
2010
15 years 6 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
181
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
150
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...