Skip to main content
Conference ProceedingsOPEN ACCESS

An interval lattice model for grid resource searching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4488 LNCS(PART 2) 689-695
DOI: 10.1007/978-3-540-72586-2_99
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In practice the information mostly expressed in interval form. Formal Concept Analysis can not deal with the interval information. So the research on interval lattice is an important task. In the paper, an interval lattice model is proposed. Then a Grid resource matching algorithm through the interval lattice is presented. In the end of the paper, experimental results show that the construction algorithm has reasonable performance on the complexity. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Zhou, W., Liu, Z., & Zhao, Y. (2007). An interval lattice model for grid resource searching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4488 LNCS, pp. 689–695). Springer Verlag. https://doi.org/10.1007/978-3-540-72586-2_99

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free