5230 search results - page 363 / 1046 » Dynamic Optimality -- Almost |
169
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...
182
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...
193
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 ...
171
click to vote
VLDB
2005
ACM
16 years 10 days ago
2005
ACM
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
174
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Many important problems in multiagent systems involve the allocation of multiple resources among the agents. If agents are self-interested, they will lie about their valuations fo...