2244 search results - page 42 / 449 » A new heuristic approach for non-convex optimization problem... |
145
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
159
click to vote
BROADNETS
2005
IEEE
15 years 11 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
176
click to vote
PATAT
2004
Springer
15 years 11 months ago
2004
Springer
Metaheuristic approaches to examination timetabling problems are usually split up into two phases: initialisation phase in which a heuristic is employed to construct an initial sol...
157
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
143
click to vote
TASLP
2010
15 years 24 days ago
2010
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...