13376 search results - page 239 / 2676 » Problem Solving with |
117
Voted
IPCCC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
144
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
121
Voted
ISHPC
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
155
Voted
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
14 years 10 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
130
Voted
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
14 years 10 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...