7006 search results - page 553 / 1402 » Approximation Algorithms |
194
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
155
click to vote
ICRA
2003
IEEE
16 years 3 days ago
2003
IEEE
— We present a novel plane tracking algorithm based on the direct update of surface parameters from two stereo images. The plane tracking algorithm is posed as an optimization pr...
184
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
192
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
176
click to vote
COCO
2005
Springer
16 years 10 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...