메뉴 건너뛰기




Volumn , Issue , 2010, Pages 57-64

Perfect hashing for state space exploration on the GPU

Author keywords

[No Author keywords available]

Indexed keywords

BIT-VECTOR REPRESENTATION; BREADTH-FIRST SEARCH; GPU ALGORITHMS; GRAPHICS CARD; GRAPHICS PROCESSING UNITS; PARALLEL COMPUTING; PERFECT HASHING; SPEED-UPS; STATE SPACE EXPLORATION; STATE SPACE SEARCH;

EID: 78650598099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (22)

References (20)
  • 1
    • 70350393266 scopus 로고    scopus 로고
    • Hash, displace, and compress
    • Fiat, A., and Sanders, P., eds., ESA, Springer
    • Belazzougui, D.; Botelho, F. C.; and Dietzfelbinger, M. 2009. Hash, displace, and compress. In Fiat, A., and Sanders, P., eds., ESA, volume 5757 of Lecture Notes in Computer Science, 682-693. Springer.
    • (2009) Lecture Notes in Computer Science , vol.5757 , pp. 682-693
    • Belazzougui, D.1    Botelho, F.C.2    Dietzfelbinger, M.3
  • 3
    • 66149167320 scopus 로고    scopus 로고
    • Efficient algorithms to rank and unrank permutations in lexicographic order
    • Bonet, B. 2008. Efficient algorithms to rank and unrank permutations in lexicographic order. In AAAI-Workshop on Search in AI and Robotics.
    • (2008) AAAI-Workshop on Search in AI and Robotics
    • Bonet, B.1
  • 5
  • 6
    • 38249012602 scopus 로고
    • New methods for using cayley graphs in interconnection networks
    • Cooperman, G., and Finkelstein, L. 1992. New methods for using cayley graphs in interconnection networks. Discrete Applied Mathematics 37/38:95-118.
    • (1992) Discrete Applied Mathematics , vol.37-38 , pp. 95-118
    • Cooperman, G.1    Finkelstein, L.2
  • 9
    • 27344444060 scopus 로고    scopus 로고
    • Large-scale parallel breadth-first search
    • Veloso, M. M.; Kambhampati, S.; Veloso, M. M.; and Kambhampati, S., eds., AAAI Press / The MIT Press
    • Korf, R. E., and Schultze, P. 2005. Large-scale parallel breadth-first search. In Veloso, M. M.; Kambhampati, S.; Veloso, M. M.; and Kambhampati, S., eds., AAAI, 1380-1385. AAAI Press / The MIT Press.
    • (2005) AAAI , pp. 1380-1385
    • Korf, R.E.1    Schultze, P.2
  • 14
    • 44849137198 scopus 로고    scopus 로고
    • NVIDIA Tesla: A unified graphics and computing architecture
    • DOI 10.1109/MM.2008.31
    • Lindholm, E.; Nickolls, J.; Oberman, S.; and Montrym, J. 2008. NVIDIA Tesla: A unified graphics and computing architecture. IEEE Micro 28(2):39-55. (Pubitemid 351796170)
    • (2008) IEEE Micro , vol.28 , Issue.2 , pp. 39-55
    • Lindholm, E.1    Nickolls, J.2    Oberman, S.3    Montrym, J.4
  • 16
    • 0035975708 scopus 로고    scopus 로고
    • Ranking and unranking permutations in linear time
    • DOI 10.1016/S0020-0190(01)00141-7, PII S0020019001001417
    • Myrvold, W., and Ruskey, F. 2001. Ranking and unranking permutations in linear time. Information Processing Letters 79(6):281-284. (Pubitemid 32771125)
    • (2001) Information Processing Letters , vol.79 , Issue.6 , pp. 281-284
    • Myrvold, W.1    Ruskey, F.2
  • 19
    • 32944479332 scopus 로고    scopus 로고
    • Breadth-first heuristic search
    • Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170(4-5):385-408.
    • (2006) Artificial Intelligence , vol.170 , Issue.4-5 , pp. 385-408
    • Zhou, R.1    Hansen, E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.