Sciweavers

1184 search results - page 29 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
IEEECIT
2005
IEEE
15 years 3 months ago
Feedback Scheduling for Resource-Constrained Real-time Control Systems
Subject to limited computational resource, feedback scheduling aims to improve, or to optimize, the global control performance of real-time control systems. For the system that co...
Pingfang Zhou, Jianying Xie
ISLPED
2000
ACM
77views Hardware» more  ISLPED 2000»
15 years 1 months ago
A recursive algorithm for low-power memory partitioning
Memory-processor integration o ers new opportunities for reducing the energy of a system. In the case of embedded systems, one solution consists of mapping the most frequently acc...
Luca Benini, Alberto Macii, Massimo Poncino
AI
2006
Springer
14 years 9 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
14 years 9 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...