#### Filter Results:

#### Publication Year

1981

2016

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; reusable resources, both numeric and interval-valued; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and… (More)

A natural approach to defining continuous change of shape is in terms of a metric that measures the difference between two regions. We consider four such metrics over regions: the Hausdorff distance, the dual-Hausdorff distance, the area of the symmetric difference, and the optimal-homeomorphism metric (a generalization of the Fréchet distance). Each of… (More)

Several algorithms are presented for the nonpreemptlve assignment of n independent tasks to m unrelated processors One algorithm requires polynomial Ume in n and m and IS at most 2x/~ times worse than optimal in the worst case This is the best polynomial-time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case… (More)

In this paper, we present an alternative to the Turing Test that has some conceptual and practical advantages. Like the original , it involves responding to typed English sentences, and English-speaking adults will have no difficulty with it. Unlike the original, the subject is not required to engage in a conversation and fool an interrogator into believing… (More)

An increasingly popular theory holds that the mind should be viewed as a near-optimal or rational engine of probabilistic inference, in domains as diverse as word learning, pragmatics, naive physics, and predictions of the future. We argue that this view, often identified with Bayesian models of inference, is markedly less promising than widely believed,… (More)