835 search results - page 64 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
AAAI
2000
14 years 4 days ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
WEBDB
2001
Springer
14 years 3 months ago
2001
Springer
Dynamic content generation poses huge resource demands on web servers, creating a scalability problem. WebView Materialization, where web pages are cached and constantly refreshed...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
COR
2011
13 years 5 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
NIPS
2003
14 years 4 days ago
2003
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...