-
## Description:
The Maze Solving Algorithm is designed to find a path from a start point to an endpoint in a maze represented as a 2D grid. The algorithm employs a backtracking approach, where it exp…
-
There is a large compute overhead for evaluating shape where clauses.
What are the performance numbers we're looking into?
The shape matching algorithm should be able to evaluate a single operati…
-
## Description:
Please provide a detailed description of the algorithm you are proposing.
## Checklist:
- [x] Contributor in GSSoC-ext-Yes
- [x] Want to work on it-Yes
## Additional Informati…
-
Using code line changes to assess member contribution seems inaccurate, the front-end tends to have a lot of html code thus far outweighing the back-end code, and it's easy to cheat this assessment al…
-
We need to scale up intersection calculation for millions of people
-
For graphs represented as large, sparse matrices.
Since this should be efficient, a fast greedy algorithm is needed. Alternatively, integrate a library that can do that.
Task includes a review on poss…
-
Can I add few more algorithms?like lightgbm,catboost,arima etc
-
-
### Ticket Contents
## Protean Overview
Protean eGov Technologies Limited provides IT services. The Company offers citizen services, e-governance solutions, system integration, business process re…
-
1inch talked about a deterministic algorithm.
The only reference I found is :
> Since the disclosure of accurate information can lead to hacking other projects, you will only see generalized data he…