840 search results - page 112 / 168 » Inapproximability of Combinatorial Optimization Problems |
89
Voted
ICAI
2004
15 years 1 months ago
2004
An explicit exploration strategy is necessary in reinforcement learning (RL) to balance the need to reduce the uncertainty associated with the expected outcome of an action and the...
108
click to vote
COLT
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
100
Voted
COR
2008
15 years 14 days ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
115
Voted
CORR
2002
Springer
15 years 5 days ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
110
click to vote
MOR
2000
15 years 4 days ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...