1263 search results - page 24 / 253 » A* with Bounded Costs |
STACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
IPL
2008
14 years 9 months ago
2008
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
TCS
2008
14 years 9 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
4OR
2004
14 years 9 months ago
2004
Abstract. Based on the recent approach of Bertsimas and Sim (2004, 2003) to robust optimization in the presence of data uncertainty, we prove an easily computable and simple bound ...