1166 search results - page 8 / 234 » Negotiating Using Rewards |
SAT
2004
Springer
14 years 2 months ago
2004
Springer
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...
SETN
2004
Springer
14 years 2 months ago
2004
Springer
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...
RE
2001
Springer
14 years 1 months ago
2001
Springer
Many software projects have failed because their requirements were poorly negotiated among stakeholders. Requirements negotiation is more critical than other factors such as tools...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
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...
AAAI
1996
13 years 10 months ago
1996
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...