2698 search results - page 147 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
165
click to vote
DFG
2009
Springer
16 years 1 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
157
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
216
click to vote
WISE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Association rule mining algorithms such as Apriori were originally developed to automatically detect patterns in sales transactions and were later on also successfully ap...
159
click to vote
TNN
1998
15 years 6 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
139
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...