16082 search results - page 274 / 3217 » Fireworks Algorithm for Optimization |
145
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
136
click to vote
NETWORKS
2008
15 years 3 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
131
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
155
click to vote
EOR
2010
15 years 1 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
131
click to vote
PPSN
1998
Springer
15 years 8 months ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...