Combinatorial search : from algorithms to systems /
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to...
|Online Access:||Online version|
No Tags, Be the first to tag this record!