495 search results - page 98 / 99 » Learning to generalize for complex selection tasks |
IUI
2004
ACM
14 years 1 months ago
2004
ACM
Complex applications in many areas, including scientific computations and business-related web services, are created from collections of components to form workflows. In many case...
HPDC
1999
IEEE
13 years 12 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
BCSHCI
2008
13 years 9 months ago
2008
Customer satisfaction with regard to user interfaces becomes increasingly more important and is, eventually, decisive for the selection of systems within a competitive market. End...
JACM
2006
13 years 7 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...