Search Results for "a star algorithm path" - Page 2
Sort By:
Showing 72 open source projects for "a star algorithm path"
View related business solutions-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
jieba
Stuttering Chinese word segmentation
"Jaba" Chinese word segmentation, do the best Python Chinese word segmentation component. Four word segmentation modes are supported. Precise mode, which tries to cut the sentence most precisely, suitable for text analysis. Full mode, scans all the words that can be formed into words in the sentence, the speed is very fast, but the ambiguity cannot be resolved. The search engine mode, on the basis of the precise mode, divides the long words again to improve the recall rate, which is suitable... -
2
Zulu Trusted Sender | Email Trust Index
The email trust rating and domain management tool application
To trust an email means that all of the necessary technical tasks are complete and the sender of the email is a responsible domain owner that has configured the correct authentication, RFC requirements and email sending best practices. Ensuring that all email is double check DMARC compliant requires ESP's to allow the return-path to be set, failing this and DMARC can be spoofed. This project is designed to provide an simple to use too for email users to quickly understand if a URL (website / email domain) can and should be trusted. It has and will prevent successful spook and phishing attacks and as a by product reduce SPAM volumes significantly. One Project using the original algorithm is Trusted Sender Score and is part of our community initiative. ... -
3
KonDB
Organizer for your Kontakt files
...Getting Started: Drag-and-drop files/folders into this app from your computer at any time to add to your index. If you drag in the same file(s) twice, it won't be re-added. Drag-and-drop your NKI/NKM file(s) directly into Kontakt from this app KNOWN ISSUE: Path+File combos beyond 260 characters fail to be added. Microsoft .NET Framework fixes do not work; currently working on a workaround PLEASE GIVE THIS PROJECT A STAR ON GITHUB!!! -> https://github.com/therealjuanmartinez/kondb This is a very niche project so please donate if you feel it is valuable!! https://www.paypal.com/cgi-bin/webscr?... -
4
PythonRobotics
Python sample codes and textbook for robotics algorithms
PythonRobotics is a Python code collection and textbook for learning robotics algorithms through readable examples. It covers practical topics such as localization, mapping, path planning, path tracking, control, SLAM, and autonomous navigation. The project is written to make each algorithm’s core idea easy to understand, rather than hiding the logic behind large frameworks. It keeps dependencies minimal so learners can focus on the math, implementation, and behavior of each robotics method.... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
Flutter Go
Demos and documentation for over 140 Flutter UI components
flutter-go is a community-driven Flutter application that serves as an interactive catalog of Flutter widgets, layouts, and patterns. It organizes the Flutter ecosystem into browsable categories—basic widgets, material components, Cupertino elements, layout primitives, and animation demos—so learners can see how pieces behave in a running app. Each entry typically includes a live example, code snippet, and brief notes on properties or usage, turning the app into a hands-on reference you can... -
6
JCSprout
Basic, concurrent algorithm
JCSprout is a curated learning path for Java engineers that mixes concise notes, diagrams, and runnable examples to cover core computer science and JVM topics. It walks readers through data structures and algorithms, networking fundamentals, Java concurrency, JVM memory model and GC, and common interview problem patterns. The repository emphasizes understanding over memorization, linking conceptual summaries with small code artifacts that can be compiled and profiled. It also highlights best... -
7
TEACUP
TCP Experiment Automation Controlled Using Python
TEACUP automates many aspects of running TCP performance experiments in a specially-constructed physical testbed. TEACUP enables repeatable testing of different TCP algorithms over a range of emulated network path conditions, bottleneck rate limits and bottleneck queuing disciplines. TEACUP utilises a text-based configuration file to define experiments as combinations of parameters specifying desired network path and end host conditions. When multiple values are provided (e.g. for TCP congestion control algorithm), an experiment is made up of multiple tests. ... -
8
Shortest Path Graph A star
finds the sortest path on the directed graph using A* algorithm.
It is the implementation of the A* algorithm for directed graph. Additionally, the implementation of the Graph is provided. For visualization of the graph and the results of the A* algorithm the data are exported in GraphViz (Graph Visualization Software) format: http://www.graphviz.org/ Various exemplary solutions are provided. See also my other two projects related to A* algorithm: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/a-star/ -
9
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
Path Finder Qt
finds the sortest path on the square board. GUI is implemented in Qt.
...For every modification of the board, the shortest path is calculated automatically. Some statistics related to A* algorithm are presented as well. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/a-star/ https://sourceforge.net/projects/shortest-path-graph-a-star/ -
11
A star
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm -
12
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
13
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file.
-
14
Algorithms in Python
Data Structures and Algorithms in Python
Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational... -
15
(RoboSim) Robot Simulator
(RoboSim) Java based Robot Localization and Path Planner Simulator.
Java based portable simulator to visualize and understand the Robot Localization, Path planning, Path Smoothing and PID controller concepts. It is very flexible and easy to use. It supports multiple platforms. The source code is available on Github where you can find latest development and up-to-date documentation. Source : https://github.com/habsoft/robosim Blog : https://robosimblog.wordpress.com Note : Use jre 1.7 to run it. 1.Histogram Filter 2.Histogram Filter with Sonar Range Finder (Experimental) 3.Kalman Filter 4.Particles Filter 5.Path Planning 6.Path Smoothing 7.PID Controller Path Planning Algorithms 1.BFS 2.DFS 3.A Star 4. ... -
16
Chemin Optimal
allow to Find the optimal path using FORD algorithm
Chemin optimal allows to draw nodes on a scene and link them with Arcs. You can affect values to each arc (the path's length). By clicking the launch button, chemin optimal show you the optimal path of the graphs using FORD algorithm. All operations are shown step by step. You can export the scene to a XML file. You can also load scene freom existing XML file. Chemin optimal check errors automatically before finding the minimal path. Chemin optimal is written in JAVA( JAVAFX ). -
17
sWangTiler
A java implementation that generates wang tiles from any input image.
...Wang tiles greatly reduce visible repetitions making textures seem more natural and thus improve the quality of any graphic application like games, simulations etc. This implementation is based on the strict wang tile algorithm as proposed by Xinyu Zhang and Young J. Kim in "Efficient Texture Synthesis Using Strict Wang Tiles". In order to calculate the lowest cost path between any edge- and sample image an implementation of Dijkstra's algorithm is used which was found in the java graph library 'JGraphT'. Credits to all mentioned parties and to http://www.texturemate.com/. -
18
Cell decomposition is one of the first applicable solution for path planning - robot path planning. The algorithm aims to find free areas (cells not occupied by obstacles) in the configuration space, and build a graph of adjacency for these cells.
-
19
ArabicDiacritizer
An automatic restoration of Arabic diacritic marks
... - Install the application using "Setup.exe". - Put an Arabic text in the Text Box. - Start the diacritization process. If the following problem occured: <Access to the path '..\ArabicDiacritizer v1.0\text.data' is denied> - Access to the path "Program Files\ArabicDiacritizer\ArabicDiacritizer v1.0\", - Right click on "ArabicDiacritizer" - Choose "Run as administrator" For further information, please contact: rebai_ily -
20
Mapmatching
Batch-mode algorithm to handle large data sets of GPS data
Batch-mode algorithm to handle large data sets of GPS data. For each journey, the algorithm globally searches for the path closest to the GPS positions. This is an algorithm of type, and so belongs to the "path to path" algorithm's type. It uses the multiple hypothesis technique and relies on an innovative weighting system based on the area between the GPS points and the arcs making up the path. -
21
Maze Solver
Solves mazes
...All you have to do is draw the maze in a text file using: the character 'T' to represent a free space, 'P' to represent a wall, the character 'S' to represent the starting point, and 'F' to represent the finishing point. Just drag and drop the text file into the program and select which algorithm you would like the program to use to solve the maze. Currently you can choose either the Recursive algorithm (which does not give you the shortest path) or the Breadth-first search algorithm (gives you the shortest path). Building requirements: You compiler needs to support C++ 11 if your compiling the C++ version. You compiler needs to support C99 if your compiling the C version. -
22
Front end Interview Questions
Help the front End community to rock interview
Interview questions for front-end developers. Only for JS developers when they have to answer some side questions to make the interviewer comfortable. To rock the interview to achieve what you deserve and to improve your concepts about front-end technologies, I have consolidated a list of questions and answers. It's a one-stop solution for front end interview process. HTML might be the heart of a website, but least utilized and explored. js dude followed the same path and put some basic... -
23
Optimal exploration path
Optimal exploration of grid environments for a realistic robot.
This project provides a resolution algorithm for the optimal exploration problem in the discrete space. Specifically, we define the optimal exploration problem as a classical AI search problem, which is solved with A*. A set of parameters and speedup techniques are proposed in order to balance the algorithm's expected computation time and the solution's quality. For more details, refer to the preliminary paper: A. Quattrini Li, F. Amigoni, and N. Basilico. Searching for optimal off-line... -
24
Reactor Breeder
A Genetic Algorithm for Reactors in StarMade
This software uses a genetic algorithm to "evolve" reactor designs for Schema's space-simulation game, Star-Made (http://star-made.org/). One of the more unique aspects of the game is that ship power management is not as simple as filling a cube with power generation blocks. This mechanism leads to difficulties in getting maximal power generation out of such reactors. -
25
VOC-DPM
Object detection system using deformable part models (DPMs)
...It implements both latent SVM training (where part assignments are treated as latent variables) and weak-label structural SVM (WL-SSVM) for learning from partially labeled data. The code integrates several enhancements: a star-cascade detection algorithm to speed up screening, context rescoring (re-ranking detections using contextual information), and various optimizations like in-memory training (rather than large on-disk data files).
