2244 search results - page 76 / 449 » A new heuristic approach for non-convex optimization problem... |
270
click to vote
MP
2006
15 years 6 months ago
2006
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensurin...
145
click to vote
EVOW
2009
Springer
16 years 29 days ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
168
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
162
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
189
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Technology scaling has offered advantages to embedded systems, such as increased performance, more available memory and reduced energy consumption. However, scaling also brings a...