Learn More
Planning is a notoriously hard combinatorial search problem. In many i n teresting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning problems many times faster than the best current planning(More)
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain classes of CNF formulas (Sel-man et al. 1992). In this paper we demonstrate that the power of local search for satissability testing can be further enhanced by employing a new strategy, called \mixed random walk", for escaping from local minima. We(More)
Numerous studies have shown that one of the most the most eeective channels for dissemination of information and expertise within an organization is its is as least as important as the oocial organizational structure for tasks ranging from immediate, local problem solving (for example, xing a piece of equipment) to primary work functions, such as creating(More)
The need for Natural Language Interfaces (NLIs) to databases has become increasingly acute as more nontechnical people access information through their web browsers, PDAs and cell phones. Yet NLIs are only usable if they map natural language questions to SQL queries <i>correctly</i>. We introduce the <sc>Precise</sc> NLI [2], which reduces the semantic(More)
We present an activity recognition feature inspired by human psychophysical performance. This feature is based on the velocity history of tracked keypoints. We present a generative mixture model for video sequences using this feature, and show that it performs comparably to local spatio-temporal features on the KTH activity recognition dataset. In addition,(More)