2698 search results - page 252 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
198
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
268
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
190
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
212
click to vote
ATAL
2005
Springer
16 years 4 days ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
141
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...