3780 search results - page 24 / 756 » Algorithms for Game Metrics |
IPCO
2008
13 years 9 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
AINA
2009
IEEE
14 years 19 days ago
2009
IEEE
Recommender systems are used to suggest customized products to users. Most recommender algorithms create collaborative models by taking advantage of web user profiles. In the las...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...