3875 search results - page 550 / 775 » Approximation algorithms for the 0-extension problem |
156
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
165
click to vote
AAAI
2010
15 years 8 months ago
2010
Due to the non-stationary environment, learning in multi-agent systems is a challenging problem. This paper first introduces a new gradient-based learning algorithm, augmenting th...
164
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
161
click to vote
ICMLA
2008
15 years 8 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
176
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/...