The plethora of content available to the consumer has become overwhelming. Increasing amounts of information are being disseminated through terrestrial broadcast, satellite, and c...
Srinivas Gutta, Kaushal Kurapati, K. P. Lee, Jacqu...
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Human categorization research is dominated by work in classification learning. The field may be in danger of equating the classification learning paradigm with the more general ph...
Bradley C. Love, Arthur B. Markman, Takashi Yamauc...
Expert decision-makers often explain decisions by citing general principles. In some domains, however, it is nearly impossible to define principles intensionally so that they may ...
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...