2244 search results - page 82 / 449 » A new heuristic approach for non-convex optimization problem... |
143
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
—Every year the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a si...
150
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
161
click to vote
AAAI
1998
15 years 7 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
161
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
139
click to vote
EMO
2003
Springer
15 years 11 months ago
2003
Springer
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...