2244 search results - page 100 / 449 » A new heuristic approach for non-convex optimization problem... |
206
click to vote
GECCO
2009
Springer
16 years 26 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
192
click to vote
LCTRTS
2010
Springer
15 years 4 months ago
2010
Springer
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
186
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
171
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
168
click to vote
QOSIP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concep...