Search Results for author: Eyal Weiss

Found 5 papers, 1 papers with code

Tightest Admissible Shortest Path

no code implementations15 Aug 2023 Eyal Weiss, Ariel Felner, Gal A. Kaminka

This is a generalization of the shortest path problem to bounded uncertainty, where edge-weight uncertainty can be traded for computational cost.

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

1 code implementation22 Aug 2022 Eyal Weiss, Ariel Felner, Gal A. Kaminka

The shortest path problem in graphs is a cornerstone of AI theory and applications.

Planning with Dynamically Estimated Action Costs

no code implementations8 Jun 2022 Eyal Weiss, Gal A. Kaminka

Information about action costs is critical for real-world AI planning applications.

Position Paper: Online Modeling for Offline Planning

no code implementations7 Jun 2022 Eyal Weiss, Gal A. Kaminka

We therefore suggest to change the AI planning process, such that is carries out online modeling in offline planning, i. e., the use of action models that are computed or even generated as part of the planning process, as they are accessed.

Position

Machine Learning Detection Algorithm for Large Barkhausen Jumps in Cluttered Environment

no code implementations27 Jun 2021 Roger Alimi, Amir Ivry, Elad Fisher, Eyal Weiss

In addition, high generalization and robustness of the neural network can be concluded, based on the rapid convergence of the corresponding receiver operating characteristic curves.

BIG-bench Machine Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.