![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Aaron Davidson 2 Darse Billings , Aaron Davidson, Jonathan Schaeffer , Duane Szafron : The challenge of poker. Artificial Intelligence 134 (1-2): 201-240 (2002) 1 Aaron Davidson: A Fast Pruning Algorithm for Optimal Sequence Alignment. BIBE 2001 : 49-56 ![]() DiSC'02 © 2003 Association for Computing Machinery |