Richard Valenzano
Richard Valenzano
Element AI
Verified email at cs.toronto.edu - Homepage
Title
Cited by
Cited by
Year
Evaluating state-space abstractions in extensive-form games
M Johanson, N Burch, R Valenzano, M Bowling
Proceedings of the 2013 international conference on Autonomous agents and …, 2013
712013
Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms
RA Valenzano, N Sturtevant, J Schaeffer, K Buro, A Kishimoto
Twentieth International Conference on Automated Planning and Scheduling, 2010
592010
Arvandherd: Parallel planning with a portfolio
R Valenzano, H Nakhost, M Müller, J Schaeffer, N Sturtevant
Proceedings of the 20th European Conference on Artificial Intelligence, 786-791, 2012
432012
A comparison of knowledge-based GBFS enhancements and knowledge-free exploration
RA Valenzano, NR Sturtevant, J Schaeffer, F Xie
Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014
352014
Using reward machines for high-level task specification and decomposition in reinforcement learning
RT Icarte, T Klassen, R Valenzano, S McIlraith
International Conference on Machine Learning, 2107-2116, 2018
332018
Teaching multiple tasks to an RL agent using LTL
R Toro Icarte, TQ Klassen, R Valenzano, SA McIlraith
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
312018
Arvand: the art of random walks
H Nakhost, M Müller, R Valenzano, F Xie
The, 15-16, 2011
192011
Using alternative suboptimality bounds in heuristic search
RA Valenzano, SJ Arfaee, J Thayer, R Stern, NR Sturtevant
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
162013
LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning.
A Camacho, RT Icarte, TQ Klassen, RA Valenzano, SA McIlraith
IJCAI 19, 6065-6073, 2019
142019
Better time constrained search via randomization and postprocessing
F Xie, R Valenzano, M Müller
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
102013
On the completeness of best-first search variants that use random exploration
RA Valenzano, F Xie
Thirtieth AAAI Conference on Artificial Intelligence, 2016
72016
Worst-case solution quality analysis when not re-expanding nodes in best-first search
RA Valenzano, NR Sturtevant, J Schaeffer
Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
72014
Learning reward machines for partially observable reinforcement learning
RT Icarte, E Waldie, T Klassen, R Valenzano, M Castro, S McIlraith
Advances in Neural Information Processing Systems, 15523-15534, 2019
62019
Advice-based exploration in model-based reinforcement learning
RT Icarte, TQ Klassen, RA Valenzano, SA McIlraith
Canadian Conference on Artificial Intelligence, 72-83, 2018
62018
Arvandherd 2014
R Valenzano, H Nakhost, M Müller, J Schaeffer, N Sturtevant
The Eighth International Planning Competition. Description of Participant …, 2014
62014
An analysis and enhancement of the gap heuristic for the pancake puzzle
RA Valenzano, DS Yang
Tenth Annual Symposium on Combinatorial Search, 2017
32017
Using Metric Temporal Logic to Specify Scheduling Problems.
R Luo, RA Valenzano, Y Li, JC Beck, SA McIlraith
KR, 581-584, 2016
32016
Probably bounded suboptimal heuristic search
R Stern, G Dreiman, R Valenzano
Artificial Intelligence 267, 39-57, 2019
22019
Searching for Markovian subproblems to address partially observable reinforcement learning
RT Icarte, E Waldie, TQ Klassen, R Valenzano, MP Castro, SA McIlraith
Proceedings of the 4th Multi-disciplinary Conference on Reinforcement …, 2019
22019
On polygon numbers of circle graphs and distance hereditary graphs
L Stewart, R Valenzano
Discrete Applied Mathematics 248, 3-17, 2018
22018
The system can't perform the operation now. Try again later.
Articles 1–20