4903 search results - page 277 / 981 » The Set Covering Machine |
199
click to vote
ISCA
1993
IEEE
15 years 11 months ago
1993
IEEE
er uses an abstract machine approach to compare the mechanisms of two parallel machines: the J-Machine and the CM-5. High-level parallel programs are translated by a single optimi...
189
click to vote
SCHEDULING
2008
15 years 6 months ago
2008
This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where ...
281
click to vote
IR
2011
15 years 1 months ago
2011
In this paper, we evaluate a number of machine learning techniques for the task of ranking answers to why-questions. We use TF-IDF together with a set of 36 linguistically motivate...
156
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
181
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...