The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Collecting digital materials is time-consuming and can gain from automation. Since each source—and even each acquisition—may involve a separate negotiation of terms, a collecto...
Fillia Makedon, Song Ye, Sheng Zhang, James Ford, ...
Many software projects have failed because their requirements were poorly negotiated among stakeholders. Requirements negotiation is more critical than other factors such as tools...
We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we wa...
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...