Publications

Export 277 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
B
Bäckström, C., Jonsson, A., and Jonsson, P., Macros, Reactive Plans and Compact Representations, Proceedings of the 20th European Conference on Artificial Intelligence (ECAI'12), 2012, pp. 85-90.
Bailey, D. D., Dalmau, V., and Kolaitis, P. G., Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems, AAAI/IAAI, 2002, pp. 620-626.
Bailey, D. D., Dalmau, V., and Kolaitis, P. G., Phase Transitions of PP-Complete Satisfiability Problems, IJCAI, 2001, pp. 183-192.
Bailey, D. D., Dalmau, V., and Kolaitis, P. G., Phase transitions of PP-complete satisfiability problems, Discrete Applied Mathematics, vol. 155, 2007, pp. 1627-1639.
Balkenius, C., Pezzulo, G., Butz, V., Castelfranchi, C., Falcone, R., Baldassarre, G., Forster, A., Grinberg, M., Herbort, O., Kriyazov, K., and , Endowing Artificial Systems with Anticipatory Capabilities: Success Cases, 2008.
Bodirsky, M., Dalmau, V., Martin, B., Mottet, A., and Pinsker, M., Distance Constraint Satisfaction Problems, Inf. Comput., vol. 247, 2016, pp. 87-105.
Bodirsky, M., and Dalmau, V., Datalog and constraint satisfaction with infinite templates, J. Comput. Syst. Sci., vol. 79, 2013, pp. 79-100.
Bodirsky, M., Dalmau, V., Martin, B., and Pinsker, M., Distance Constraint Satisfaction Problems, MFCS, 2010, pp. 162-173.
Bodirsky, M., and Dalmau, V., Datalog and Constraint Satisfaction with Infinite Templates, STACS, 2006, pp. 646-659.
Bonet, B., and Geffner, H., Flexible and Scalable Partially Observable Planning with Linear Translations, AAAI, 2014.
Bonet, B., and Geffner, H., Planning under partial observability by classical replanning: Theory and experiments, Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume Three, AAAI Press, 2011, pp. 1936–1941.
Bonet, B., and Geffner, H., Planning with Incomplete Information as Heuristic Search in Belief Space, Proc. of AIPS-00, 2000.
Bonet, B., and Geffner, H., Policies that Generalize: Solving Many Planning Problems with the Same Policy, Proc IJCAI 2015, 2015.
Bonet, B., and Geffner, H., Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning., AAAI, 2012.
Bonet, B., and Geffner, H., Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming, Proc. 13th Int. Conf. on Automated Planning & Scheduling (ICAPS-2003), AAAI Press, 2003, pp. 12–31.
Bonet, B., and Geffner, H., An algorithm better than AO*?, Proc. AAAI-05, 2005.
Bonet, B., and Geffner, H., Action Selection for MDPs: Anytime AO* Versus UCT., AAAI, 2012.
Bonet, B., and Geffner, H., Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback, Proc. of Int. Joint Conf. on Artificial Intelligence (IJCAI-03), 2003, pp. 1233–1238.
Bonet, B., and Geffner, H., Planning as heuristic search: New results, Recent Advances in AI Planning, Springer, 2000, pp. 360–372.
Bonet, B., and Geffner, H., Belief tracking for planning with sensing: Width, complexity and approximations, Journal of Artificial Intelligence Research, 2014, pp. 923–970.
Bonet, B., and Geffner, H., Learning in DFS: A Unified Approach to Heuristic Search in Deterministic, Non-Deterministic, Probabilistic, and Game Tree Settings, Proc. Int. Conf. on Automated Planning & Scheduling (ICAPS-06), 2005.
Bonet, B., and Geffner, H., Factored Probabilistic Belief Tracking, Proc. 25th Int. Joint Conf. on Artificial Intelligence, 2016.
Bonet, B., and Geffner, H., Causal belief decomposition for planning with sensing: completeness results and practical approximation, Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, AAAI Press, 2013, pp. 2275–2281.
Boutilier, C., Lang, J., Oren, J., and Palacios, H., Robust winners and winner determination policies under candidate uncertainty, 2014.
Bulatov, A. A., Dalmau, V., Grohe, M., and Marx, D., Enumerating Homomorphisms, STACS, 2009, pp. 231-242.

Pages