3422 search results - page 347 / 685 » Random Subset Optimization |
128
click to vote
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
129
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Existing test problems for multi-objective optimization are criticized for not having adequate linkages among variables. In most problems, the Pareto-optimal solutions correspond ...
136
click to vote
AAAI
2007
15 years 6 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
125
click to vote
ICONIP
2008
15 years 6 months ago
2008
This paper presents a novel and notable swarm approach to evolve an optimal set of weights and architecture of a neural network for classification in data mining. In a distributed ...
139
click to vote
IC
2004
15 years 5 months ago
2004
Distributed crawling is able to overcome important limitations of the traditional single-sourced web crawling systems. However, the optimal benefit of distributed crawling is usual...