12519 search results - page 156 / 2504 » Approximation Problems Categories |
164
click to vote
NIPS
2008
15 years 7 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
160
click to vote
IPCO
2001
15 years 7 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
159
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
108
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
157
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...