438 search results - page 64 / 88 » Optimal Solvers for PDE-Constrained Optimization |
129
click to vote
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
146
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
143
Voted
SARA
2009
Springer
15 years 10 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
168
Voted
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
132
Voted
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...