4354 search results - page 210 / 871 » Classification-based objective functions |
170
click to vote
AAAI
2007
15 years 9 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
181
Voted
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
197
Voted
ANOR
2010
15 years 7 months ago
2010
Abstract-- The emerging paradigm of Grid Computing provides a powerful platform for the optimisation of complex computer models, such as those used to simulate real-world logistics...
179
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
223
click to vote
JMLR
2008
15 years 7 months ago
2008
A method is introduced to learn and represent similarity with linear operators in kernel induced Hilbert spaces. Transferring error bounds for vector valued large-margin classifie...