1184 search results - page 66 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
103
click to vote
ICCAD
2007
IEEE
2007
IEEE
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
15 years 11 months ago
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
107
click to vote
ANTSW
2004
Springer
15 years 7 months ago
2004
Springer
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
137
click to vote
DISOPT
2008
15 years 2 months ago
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
ASAP
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
122
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-d...