Partial order bounding: a new approach to evaluation in game tree search
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|partial order bounding: a new approach to evaluation in game tree search }}
- [[]]
bibtex
{{#vardefine:pagename|Partial order bounding: a new approach to evaluation in game tree search }}{{#vardefine:key| }}
abstract:
download:
Facts about Partial order bounding: a new approach to evaluation in game tree searchRDF feed
| Author | Martin Müller + |
| Bibtype | article + |
| Journal | Artificial Intelligence + |
| Key | Müller00partialorder + |
| Paper url | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.714&rep=rep1&type=pdf + |
| Relation | AND/OR graph + |
| Tag | Computer science + |
| Title | Partial Order Bounding: A new Approach to Evaluation in Game Tree Search + |
| Year | 2000 + |

