Learning QoE of mobile video transmission with deep neural network: A data-driven approach

X Tao, Y Duan, M Xu, Z Meng… - IEEE Journal on Selected …, 2019 - ieeexplore.ieee.org
Quality of experience (QoE) serves as a direct evaluation of users' experiences in mobile
video transmission and thus essential for network management, such as network …

[HTML][HTML] Efficient symbolic search for cost-optimal planning

Á Torralba, V Alcázar, P Kissmann, S Edelkamp - Artificial Intelligence, 2017 - Elsevier
In cost-optimal planning we aim to find a sequence of operators that achieve a set of goals
with minimum cost. Symbolic search with Binary Decision Diagrams (BDDs) performs …

Front-to-end bidirectional heuristic search with near-optimal node expansions

J Chen, RC Holte, S Zilles, NR Sturtevant - arXiv preprint arXiv …, 2017 - arxiv.org
It is well-known that any admissible unidirectional heuristic search algorithm must expand all
states whose $ f $-value is smaller than the optimal solution cost when using a consistent …

MM: A bidirectional search algorithm that is guaranteed to meet in the middle

RC Holte, A Felner, G Sharon, NR Sturtevant, J Chen - Artificial Intelligence, 2017 - Elsevier
Bidirectional search algorithms interleave two separate searches, a normal search forward
from the start state, and a search backward from the goal. It is well known that adding a …

A brief history and recent achievements in bidirectional search

N Sturtevant, A Felner - Proceedings of the AAAI Conference on …, 2018 - ojs.aaai.org
The state of the art in bidirectional search has changed significantly a very short time period;
we now can answer questions about unidirectional and bidirectional search that until very …

Sufficient conditions for node expansion in bidirectional heuristic search

J Eckerle, J Chen, N Sturtevant, S Zilles… - Proceedings of the …, 2017 - ojs.aaai.org
In this paper we study bidirectional state space search with consistent heuristics, with a
focus on obtaining sufficient conditions for node expansion, that is, conditions characterizing …

The minimal set of states that must be expanded in a front-to-end bidirectional search

E Shaham, A Felner, J Chen, N Sturtevant - Proceedings of the …, 2017 - ojs.aaai.org
A* is optimal among admissible unidirectional algorithms when searching with a consistent
heuristic. Recently, similar optimality bounds have been established for bidirectional search …

Minimizing node expansions in bidirectional search with consistent heuristics

E Shaham, A Felner, N Sturtevant… - Proceedings of the …, 2018 - ojs.aaai.org
A* is optimally effective with regard to node expansions among unidirectional admissible
algorithms—those that only assume that the heuristic used is admissible. Among …

Euclidean pathfinding with compressed path databases

B Shen, MA Cheema, DD Harabor… - … Joint Conference on …, 2020 - research.monash.edu
We consider optimal and anytime algorithms for the Euclidean Shortest Path Problem
(ESPP) in two dimensions. Our approach leverages ideas from two recent works: Polyanya …

Dynamic potential search—a new bounded suboptimal search

D Gilon, A Felner, R Stern - Proceedings of the International Symposium …, 2016 - ojs.aaai.org
Potential Search (PS) is an algorithm that is designed to solve bounded cost search
problems. In this paper, we modify PS to work within the framework of bounded suboptimal …