Hootan Nakhost
Hootan Nakhost
Doctor, Google
No verified email
Title
Cited by
Cited by
Year
Monte-Carlo exploration for deterministic planning
H Nakhost, M Müller
Twenty-First International Joint Conference on Artificial Intelligence, 2009
1242009
Resource-Constrained Planning: A Monte Carlo Random Walk Approach
H Nakhost, J Hoffmann, M Müller
59*
Action elimination and plan neighborhood graph search: Two algorithms for plan improvement
H Nakhost, M Müller
Twentieth International Conference on Automated Planning and Scheduling, 2010
562010
Arvandherd: Parallel planning with a portfolio
R Valenzano, H Nakhost, M Müller, J Schaeffer, N Sturtevant
ECAI 2012, 786-791, 2012
452012
Planning via random walk-driven local search
F Xie, H Nakhost, M Müller
Twenty-Second International Conference on Automated Planning and Scheduling, 2012
292012
Arvand: the art of random walks
H Nakhost, M Müller, R Valenzano, F Xie
The, 15-16, 2011
192011
Improving local search for resource-constrained planning
H Nakhost, J Hoffmann, M Müller
Third Annual Symposium on Combinatorial Search, 2010
162010
Towards a second generation random walk planner: an experimental exploration
H Nakhost, M Müller
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
152013
A Theoretical Framework for Studying Random Walk Planning
H Nakhost, M Müller
92012
Formal verification of the IEEE 802.1 D spanning tree protocol using extended Rebeca
H Hojjat, H Nakhost, M Sirjani
Electronic Notes in Theoretical Computer Science 159, 139-154, 2006
92006
Arvandherd 2014
R Valenzano, H Nakhost, M Müller, J Schaeffer, N Sturtevant
The Eighth International Planning Competition. Description of Participant …, 2014
72014
Random Walk Planning: Theory, Practice, and Application
H Nakhost
University of Alberta (Canada), 2013
52013
A local monte carlo tree search approach in deterministic planning
F Xie, H Nakhost, M Müller
Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
52011
Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions
H Nakhost, M Mueller
AI Communications 27 (4), 329-344, 2014
22014
Action elimination and plan neighborhood graph search: Two algorithms for plan improvement-extended version
H Nakhost, M Müller
22010
Monte-carlo search for deterministic planning
H Makhost, M Muller
Association for the Advancement of Artificial Intelligence, 2010
12010
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP).
H Hojjat, H Nakhost, M Sirjani
J. Univers. Comput. Sci. 13 (13), 2076-2104, 2007
12007
Improving Local Search for Resource-Constrained Planning
M Mueller, J Hoffman, H Nakhost
2010
The system can't perform the operation now. Try again later.
Articles 1–18