{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:03:37Z","timestamp":1725559417125},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540269182"},{"type":"electronic","value":"9783540320364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11508380_57","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:22:26Z","timestamp":1279056146000},"page":"557-566","source":"Crossref","is-referenced-by-count":4,"title":["Rough Set Based Computation Times Estimation on Knowledge Grid"],"prefix":"10.1007","author":[{"given":"Kun","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youquan","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiqun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","unstructured":"Talia, D., Cannataro, M.: Knowledge grid: An architecture for distributed knowledge discovery. Communications of the ACM (2002)"},{"key":"57_CR2","volume-title":"The Grid: blueprint for a future infrastructure","author":"I. Foster","year":"1999","unstructured":"Foster, I., Kasselman, C.: The Grid: blueprint for a future infrastructure. Morgan Kaufmann, San Francisco (1999)"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jnca.2000.0110","volume":"23","author":"A. Chervenak","year":"2001","unstructured":"Chervenak, A., Foster, I., Kesselman, C., Salisbury, C., Tuecke, S.: The Data Grid: towards an architecture for the distributed management and analysis of large scientific datasets. J. of Network and Comp. Appl.\u00a023, 187\u2013200 (2001)","journal-title":"J. of Network and Comp. Appl."},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: Predicting Queue Times on Space-Sharing Parallel Computers. In: Proceedings of the 11th International Parallel Processing Symposium, pp. 209\u2013218 (1997)","DOI":"10.1109\/IPPS.1997.580894"},{"key":"57_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-63574-2_16","volume-title":"Inductive Logic Programming","author":"R. Gibbons","year":"1997","unstructured":"Gibbons, R.: A Historical Application Profiler for Use by Parallel Schedulers. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 58\u201375. Springer, Heidelberg (1997)"},{"key":"57_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053984","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Smith","year":"1998","unstructured":"Smith, W., Foster, I., Taylor, V.: Predicting Application Runtimes Using Historical Information. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 122\u2013142. Springer, Heidelberg (1998)"},{"key":"57_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-47954-6_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Smith","year":"1999","unstructured":"Smith, W., Taylor, V., Foster, I.: Using Runtime Predictions to Estimate Queue Wait Times and Improve Scheduler Performance. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol.\u00a01659, pp. 202\u2013229. Springer, Heidelberg (1999)"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerini, P., Perego, R., Silvestri, F.: Scheduling high performance data mining tasks on a data grid environment. In: Proceedings of Europar (2002)","DOI":"10.1007\/3-540-45706-2_49"},{"key":"57_CR9","unstructured":"Hu, X.: Knowledge discovery in databases: An attribute-oriented rough set approach. Ph.D thesis, Regina university (1995)"},{"key":"57_CR10","first-page":"19","volume":"3","author":"J. Starzyk","year":"1998","unstructured":"Starzyk, J., Nelson, D.E., Sturtz, K.: Reduct generation in information systems. Bulletin of international rough set society\u00a03, 19\u201322 (1998)","journal-title":"Bulletin of international rough set society"},{"key":"57_CR11","first-page":"3","volume-title":"Rough-Fuzzy Hybridization: A New Trend in Decision Making","author":"J. Komorowski","year":"1998","unstructured":"Komorowski, J., et al.: Rough Sets: A Tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough-Fuzzy Hybridization: A New Trend in Decision Making, pp. 3\u201398. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Grid Computing - EGC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11508380_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:45:01Z","timestamp":1619505901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11508380_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269182","9783540320364"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11508380_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}