메뉴 건너뛰기




Volumn 90, Issue , 1999, Pages 45-63

The parallel search bench ZRAM and its applications

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0041637375     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018972901171     Document Type: Article
Times cited : (56)

References (29)
  • 1
    • 0013639178 scopus 로고
    • The solution of the four-color-map problem
    • Oct.
    • K. Appell and W. Haken, The solution of the four-color-map problem, Sci. American (Oct. 1977) 108-121.
    • (1977) Sci. American , pp. 108-121
    • Appell, K.1    Haken, W.2
  • 2
    • 34249842390 scopus 로고
    • A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
    • D. Avis and K. Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Computational Geometry 8(1992)295-313.
    • (1992) Discrete Computational Geometry , vol.8 , pp. 295-313
    • Avis, D.1    Fukuda, K.2
  • 7
    • 0001876097 scopus 로고
    • Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactions
    • G. Ceder, G.D. Garbulsky, D. Avis and K. Fukuda, Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactions, Physical Review B49(1994)1-7.
    • (1994) Physical Review , vol.B49 , pp. 1-7
    • Ceder, G.1    Garbulsky, G.D.2    Avis, D.3    Fukuda, K.4
  • 8
    • 4244001646 scopus 로고    scopus 로고
    • Parallel best-first branch-and-bound in discrete optimization: A framework
    • LNCS 1054, eds. A. Ferreira and P. Pardalos, Springer, Berlin
    • R. Corrêa and A. Ferreira, Parallel best-first branch-and-bound in discrete optimization: A framework, in: Solving Combinatorial Optimization Problems in Parallel, LNCS 1054, eds. A. Ferreira and P. Pardalos, Springer, Berlin, 1996, pp. 171-200.
    • (1996) Solving Combinatorial Optimization Problems in Parallel , pp. 171-200
    • Corrêa, R.1    Ferreira, A.2
  • 11
    • 37449003977 scopus 로고    scopus 로고
    • Double description method revisited
    • Springer. PS file available from ifor13.ethz.ch (129.132.154.13), directory/pub/ fukuda/reports
    • K. Fukuda and A. Prodon, Double description method revisited, to appear in: Lecture Notes in Computer Science, Springer. PS file available from ifor13.ethz.ch (129.132.154.13), directory/pub/ fukuda/reports.
    • Lecture Notes in Computer Science
    • Fukuda, K.1    Prodon, A.2
  • 14
    • 0028550919 scopus 로고
    • Parallel branch-and-bound algorithms. Survey and synthesis
    • B. Gendron and T.G. Crainic, Parallel branch-and-bound algorithms. Survey and synthesis, Operations Research 42(1994)1042-1066.
    • (1994) Operations Research , vol.42 , pp. 1042-1066
    • Gendron, B.1    Crainic, T.G.2
  • 16
    • 84966254647 scopus 로고
    • Estimating the efficiency of backtrack programs
    • D.E. Knuth, Estimating the efficiency of backtrack programs, Math. Comp. 29(1975)121-136.
    • (1975) Math. Comp. , vol.29 , pp. 121-136
    • Knuth, D.E.1
  • 18
    • 84872995230 scopus 로고
    • Depth-first iterative deepening: An optimal admissible tree search
    • R.E. Korf, Depth-first iterative deepening: An optimal admissible tree search, Artificial Intelligence 62(1993)97-109.
    • (1993) Artificial Intelligence , vol.62 , pp. 97-109
    • Korf, R.E.1
  • 19
    • 0042359404 scopus 로고
    • Generic branch-and-bound on a network of transputers
    • eds. R. Grebe et al., IOS Press, Amsterdam
    • N. Kuck, M. Middendorf and H. Schmeck, Generic branch-and-bound on a network of transputers, in: Transputer Applications and Systems '93, eds. R. Grebe et al., IOS Press, Amsterdam, 1993, pp. 521-535.
    • (1993) Transputer Applications and Systems '93 , pp. 521-535
    • Kuck, N.1    Middendorf, M.2    Schmeck, H.3
  • 21
    • 84936632302 scopus 로고
    • Experience with a new distributed termination detection algorithm
    • LNCS 312, Springer
    • F. Mattern, Experience with a new distributed termination detection algorithm, in: Distributed Algorithms 1987, LNCS 312, Springer, 1987, pp. 127-143.
    • (1987) Distributed Algorithms 1987 , pp. 127-143
    • Mattern, F.1
  • 23
    • 21844499898 scopus 로고
    • All the needles in a haystack: Can exhaustive search overcome combinatorial chaos?
    • Computer Science Today, ed. J. van Leeuwen, Springer
    • J. Nievergelt, R. Gasser, F. Mäser and C. Wirth, All the needles in a haystack: Can exhaustive search overcome combinatorial chaos?, Invited paper in Lecture Notes in Computer Science 1000, Computer Science Today, ed. J. van Leeuwen, Springer, 1995, pp. 254-274.
    • (1995) Lecture Notes in Computer Science , vol.1000 , pp. 254-274
    • Nievergelt, J.1    Gasser, R.2    Mäser, F.3    Wirth, C.4
  • 24
    • 0013056045 scopus 로고
    • Finding a shortest solution for the (N × N)-extension of the 15-puzzle is intractable
    • D. Ratner and M. Warmuth, Finding a shortest solution for the (N × N)-extension of the 15-puzzle is intractable, Journal of Symbolic Computation 10(1990)111-137.
    • (1990) Journal of Symbolic Computation , vol.10 , pp. 111-137
    • Ratner, D.1    Warmuth, M.2
  • 25
    • 84873016152 scopus 로고
    • Enhanced iterative-deepening search
    • Paderborn Center for Parallel Computing
    • A. Reinefeld and T.A. Marsland, Enhanced iterative-deepening search, Reihe Informatik 120, Paderborn Center for Parallel Computing, 1993.
    • (1993) Reihe Informatik , vol.120
    • Reinefeld, A.1    Marsland, T.A.2
  • 27
    • 84872999134 scopus 로고
    • Chess endgames, vol. 1
    • K. Thompson, Chess endgames, vol. 1, ICCA Journal 14(1991)22.
    • (1991) ICCA Journal , vol.14 , pp. 22
    • Thompson, K.1
  • 28
    • 84873003007 scopus 로고
    • Chess endgames, vol. 2
    • K. Thompson, Chess endgames, vol. 2, ICCA Journal 15(1992)149.
    • (1992) ICCA Journal , vol.15 , pp. 149
    • Thompson, K.1
  • 29
    • 25544437016 scopus 로고
    • Portable parallel branch-and-bound library: User manual
    • University of Paderborn
    • S. Tschöke and T. Polzer, Portable parallel branch-and-bound library: User manual, Technical Report, University of Paderborn, 1995.
    • (1995) Technical Report
    • Tschöke, S.1    Polzer, T.2


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