4433 search results - page 290 / 887 » Dynamic Optimization of Micro-Operations |
162
click to vote
NIPS
2003
15 years 8 months ago
2003
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
176
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
185
click to vote
JUCS
2007
15 years 6 months ago
2007
: This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining ...
181
click to vote
CEC
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
157
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...