[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/pami/KaindlSH91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Helmut_Horacek>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hermann_Kaindl>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Reza_Shams>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F34.106996>
foaf:homepage <https://doi.org/10.1109/34.106996>
dc:identifier DBLP journals/pami/KaindlSH91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F34.106996 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/pami>
rdfs:label Minimax Search Algorithms With and Without Aspiration Windows. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Helmut_Horacek>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hermann_Kaindl>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Reza_Shams>
swrc:number 12 (xsd:string)
swrc:pages 1225-1235 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/pami/KaindlSH91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/pami/KaindlSH91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/pami/pami13.html#KaindlSH91>
rdfs:seeAlso <https://doi.org/10.1109/34.106996>
dc:subject minimax search algorithms; aspiration windows; exact minimax values; game trees; backward pruning; uniform distribution; linear space complexity; alpha-beta search; computational complexity; game theory; minimax techniques; search problems; trees (mathematics) (xsd:string)
dc:title Minimax Search Algorithms With and Without Aspiration Windows. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 13 (xsd:string)