3475 search results - page 191 / 695 » Backbones in Optimization and Approximation |
174
click to vote
JMLR
2010
15 years 1 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
173
click to vote
SIAMCO
2010
15 years 1 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
187
click to vote
TCOM
2010
15 years 1 months ago
2010
Abstract--This paper provides a systematic mutual information (MI) and multichannel beamforming (MBF) characterization of optimized multiple-input multiple-output (MIMO) communicat...
295
click to vote
TON
2010
15 years 1 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
160
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
k- and t-optimality algorithms [9, 6] provide solutions to DCOPs that are optimal in regions characterized by its size and distance respectively. Moreover, they provide quality gu...