Search Results for author:
Found 5 papers, 1 papers with code
Comparison and Evaluation of Methods for a Predict+Optimize Problem in Renewable Energy
As both forecasting and optimization are difficult problems in their own right, relatively few research has been done in this area.
Enhanced Methods for the Weight Constrained Shortest Path Problem
This paper leverages the recent state-of-the-art techniques in both constrained pathfinding and bi-objective search and presents two new solution approaches to the WCSPP on the basis of A* search, both capable of solving hard WCSPP instances on very large graphs.
Bi-objective Search with Bi-directional A*
Bi-objective search is a well-known algorithmic problem, concerned with finding a set of optimal solutions in a two-dimensional domain.
Versatile and Robust Transient Stability Assessment via Instance Transfer Learning
To support N-1 pre-fault transient stability assessment, this paper introduces a new data collection method in a data-driven algorithm incorporating the knowledge of power system dynamics.
Solution Dominance over Constraint Satisfaction Problems
We define Constraint Dominance Problems (CDPs) as CSPs with a dominance relation, that is, a preorder over the solutions of the CSP.
