2354 search results - page 203 / 471 » Assignment Problems |
194
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
183
click to vote
NAACL
2007
15 years 7 months ago
2007
We address the problem of analyzing multiple related opinions in a text. For instance, in a restaurant review such opinions may include food, ambience and service. We formulate th...
176
Voted
NIPS
2001
15 years 7 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
156
click to vote
PDPTA
2004
15 years 7 months ago
2004
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
186
click to vote
IJCAI
2003
15 years 7 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...