1972 search results - page 327 / 395 » Evolutionary algorithms and dynamic programming |
136
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
121
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
—We investigate the problem of minimizing the overall transmission delay of data packets in a single-user wireless communication system, where the transmitter has a fixed amount...
150
click to vote
SARA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
145
Voted
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
145
click to vote
DAC
1994
ACM
15 years 9 months ago
1994
ACM
- This paper studies the routing problem for a new Field-Programmable Gate Array (FPGA) and Field-Programmable Interconnect Chip (FPIC) routing architecture which improves upon the...