34170 search results - page 456 / 6834 » Optimization |
151
click to vote
NIPS
2008
15 years 8 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
194
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
191
click to vote
WICON
2008
15 years 8 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
188
click to vote
AAAI
2004
15 years 8 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
177
click to vote
AAAI
2004
15 years 8 months ago
2004
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...