-
Notifications
You must be signed in to change notification settings - Fork 26
ALERT: Improvement made to the algorithm for generating all track candidates. #508
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
ALERT: Improvement made to the algorithm for generating all track candidates. #508
Conversation
Now this option can be setup from the yaml file with the option Mode:
```
ALERT:
Mode: "AI_Track_Finding"
```
Add a cut on the number of hits to rely on the conventional track finding with there is more than 300 hits.
- Use a single thread for the inference. - Remove waring about the graph executor optimization
|
pre-commit.ci job will pass once #505 is merged; sorry we may have done the pre-commit activation steps a bit out of order |
| public TrackConstruction() {} | ||
|
|
||
| /** | ||
| * Computes the modulo operation, which returns the remainder of the division |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
probably should be IEEERemainder
| * @param number_of_track_candidates The current count of track candidates. | ||
| * @return A list of all possible combinations of integers from {@code v1} and {@code v2}. | ||
| */ | ||
| private ArrayList<ArrayList<Integer>> cartesian_product(ArrayList<ArrayList<Integer>> v1, ArrayList<Integer> v2, MutableBoolean too_much_track_candidates, int number_of_track_candidates) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
probably simplifieable, maybe warrants optimization
Now, this option can be set up from the YAML file with the option Mode: