4843 search results - page 245 / 969 » The Shortcut Problem - Complexity and Approximation |
130
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
171
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
136
Voted
AAAI
2007
15 years 6 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
129
Voted
COLOGNETWENTE
2008
15 years 5 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
114
Voted
SIAMCO
2000
15 years 3 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...