1382 search results - page 44 / 277 » Formal Analysis of Online Algorithms |
137
click to vote
ISCC
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we first attempt to formally define the resource control framework that adjusts the resource provisioning at the hotspot during congestion. In an effort to find ...
163
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
143
click to vote
IPL
2008
15 years 5 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
134
click to vote
ISPA
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
151
click to vote
KDD
2009
ACM
16 years 16 days 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...