Nanda+Srimani

toc
 * Home * People * Nanda Srimani**

an American computer scientist, in the 80s affiliated with the Computer Science Department, [|Southern Illinois University], [|Carbondale, Illinois]. She holds a M.Sc. from University of Alberta, where she worked with Tony Marsland on a sequential tree searching algorithm PS*(k), based on the State Space Search (SSS*). PS*(k) divides each MAX node of a game tree into k partitions, which are then searched in sequence. By this means two major disadvantages of SSS*, storage demand and maintenance overhead, are significantly reduced, and yet the corresponding increase in nodes visited is not so great even in the random tree case.
 * Nanda Srimani**,

=Selected Publications=
 * Nanda Srimani (**1985**). //A New Algorithm (PS*) for Searching Game Trees//. Master's thesis, University of Alberta
 * Tony Marsland, Nanda Srimani (**1986**). //Phased State Search//. [|Fall Joint Computer Conference], [|pdf]

=External Links=
 * [|Nanda Srimani – Google+]

=References= =What links here?= include page="Nanda Srimani" component="backlinks" limit="20"
 * Up one level**