Mausam
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mausam has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Jeff Bilmes
Department of Computer Science and Engineering, Box 352350, University of Washington, Seattle, WA 98195, United States
2 shared publicationsMichael Skinner
Department of Computer Science and Engineering, Box 352350, University of Washington, Seattle, WA 98195, United States
2 shared publicationsOren Etzioni
Department of Computer Science and Engineering, Box 352350, University of Washington, Seattle, WA 98195, United States
2 shared publicationsStephen Soderland
Department of Computer Science and Engineering, Box 352350, University of Washington, Seattle, WA 98195, United States
2 shared publicationsDaniel S. Weld
Department of Computer Science and Engineering, Box 352350, University of Washington, Seattle, WA 98195, United States
1 shared publication- Daniel Sabby Weld
Allen Institute for AI, Seattle, USA
1 shared publication
Latest Publications
- Open Access
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains
We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms, HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those parts of the state space that could be reached from the start state by following an optimal policy. We show that this approach is especially effective when resource constraints limit how much of the state space is reachable. Experimental results demonstrate its effectiveness in the domain that motivates our research: automated planning for planetary exploration rovers.
Open AccessA Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains
We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms, HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those parts of the state space that could be reached from the start state by following an optimal policy. We show that this approach is especially effective when resource constraints limit how much of the state space is reachable. Experimental results demonstrate its effectiveness in the domain that motivates our research: automated planning for planetary exploration rovers.
- 1 June 2010
- Published by Elsevier in Artificial Intelligence
- Vol. 174 (9-10) , 619-637
Panlingual lexical translation via probabilistic inference
- 1 June 2010
- Published by Elsevier in Artificial Intelligence
- Vol. 174 (9-10) , 619-637
Panlingual lexical translation via probabilistic inference
- 1 January 2009
- Published by Association for Computational Linguistics (ACL)
A rose is a roos is a ruusu
- 1 January 2009
- Published by Association for Computational Linguistics (ACL)
A rose is a roos is a ruusu
- 1 January 2009
- Published by Association for Computational Linguistics (ACL)
- p. 262-270
Compiling a massive, multilingual dictionary via probabilistic inference
- 1 January 2009
- Published by Association for Computational Linguistics (ACL)
- p. 262-270
Compiling a massive, multilingual dictionary via probabilistic inference