1184 search results - page 21 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
ICIP
2007
IEEE
15 years 3 months ago
2007
IEEE
Significant power savings can be achieved on voltage/frequency configurable platforms by dynamically adapting the frequency and voltage according to the workload (complexity). Vid...
ASPDAC
2012
ACM
13 years 5 months ago
2012
ACM
Behavioral synthesis tools have made significant progress in compiling high-level programs into register-transfer level (RTL) specifications. But manually rewriting code is still ...
105
click to vote
TON
2008
14 years 9 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
105
click to vote
SIAMJO
2002
14 years 9 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...