1684 search results - page 39 / 337 » The lexicographic decision function |
NIPS
2004
14 years 11 months ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
CADE
1998
Springer
15 years 2 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
PADL
2001
Springer
15 years 2 months ago
2001
Springer
The goal of this paper is to test if a programming methodology based on the declarative language A-Prolog and the systems for computing answer sets of such programs, can be succes...