Publications
- Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals2017 | Faculty of Mathematics and Physics
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Faculty of Mathematics and Physics
- Adversarial Cooperative Path-finding: Complexity and Algorithms2014 | Faculty of Mathematics and Physics
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Faculty of Mathematics and Physics
- Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability2014 | Faculty of Mathematics and Physics
- Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More2014 | Faculty of Mathematics and Physics
- Optimal Cooperative Path Planning through Satisfiability Solving2013 | Faculty of Mathematics and Physics
- Shortening Plans by Local Re-Planning2012 | Faculty of Mathematics and Physics
- Attribute Extraction and Processing for Automated Classification of Bitmap Images2011 | Faculty of Mathematics and Physics
- Automated Classification of Bitmap Images Using Decision Trees2011 | Faculty of Mathematics and Physics
Loading network view...
