Search Results for "a star algorithm path" - Page 2
Sort By:
Showing 103 open source projects for "a star algorithm path"
View related business solutions-
The AI workplace management platformBy combining AI workflows, predictive intelligence, and automated insights, OfficeSpace gives leaders a complete view of how their spaces are used and how people work. Facilities, IT, HR, and Real Estate teams use OfficeSpace to optimize space utilization, enhance employee experience, and reduce portfolio costs with precision.
-
Comet Backup - Fast, Secure Backup Software for MSPsComet is a flexible backup platform, giving you total control over your backup environment and storage destinations.
-
1
AcoPath
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. Development takes place at https://github.com/zfoxer/AcoPath -
2
PsoPath
Particle Swarm Optimization algorithm for the shortest path problem
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. Specifically, a particle is an entity representing a solution in the search space. Several particles cooperate... -
3
Soma-direct
System Omnichannel Marketing Analysis
Soma - System Omnichannel Marketing Analysis is an open-source solution for simplifying the processes of analyzing and predicting consumer behavior. With Soma, you can combine data from multiple systems and channels in the profile joining process. Interactions and behaviors registered as a part of a unique user create and show what a Customer Journey looks like. The data is subjected to an analysis process which enables the examination of the significance of individual touchpoints for the... -
4
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... -
Get full visibility and control over your tasks and projects with Wrike.Wrike offers world-class features that empower cross-functional, distributed, or growing teams take their projects from the initial request stage all the way to tracking work progress and reporting results.
-
5
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. ... -
6
Dep
Go dependency management tool experiment
Dep was an official experiment to implement a package manager for Go. While dep has many discrete components and moving parts, all of these parts revolve around a central model. Dep is a tool intended primarily for use by developers, to support the work of actually writing and shipping code. It is not intended for end users who are installing Go software - that's what go get does. It is strongly recommended that you use a released version of dep. While tip is never purposefully broken, its... -
7
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?... -
8
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... -
9
Shape Shifter
SVG icon animation tool for Android, iOS, and the web
Shape Shifter is a web-app that simplifies the creation of icon animations for Android, iOS, and the web. This tool currently exports to standalone SVGs, SVG spritesheets, and CSS keyframe animations for the web, as well as to AnimatedVectorDrawable format for Android. I am totally open to adding support for other export formats as well, so if you have a format that you'd like to see added in the future, file a feature request! The ability to add/remove points to each path without altering... -
Data management solutions for confident marketingVerify, deduplicate, manipulate, and assign records automatically to keep your CRM data accurate, complete, and ready for business.
-
10
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... -
11
ShapeOfView
Give a custom shape to any android view, Material Design 2 ready
...Rather than sticking to Android’s default rectangular layout for views, ShapeOfView allows you to “clip” or mask a view into a variety of shapes (circle, triangle, star, polygon, custom path, etc.), and optionally include shadows (when using elevation) — making it possible to build UI components that diverge from the standard boxy look. It supports both predefined shapes (round rects, circles, arcs, bubbles, triangles, stars, polygons, diagonals, cut corners) and fully custom shapes via clipping paths or drawables. ... -
12
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. ... -
13
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/ -
14
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... -
15
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/ -
16
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 -
17
Advanced Onion Router is a portable client for the OR network and is intended to be an improved alternative for Tor+Vidalia+Privoxy bundle for Windows users. Some of the improvements include UNICODE paths, support for HTTP and HTTPS proxy protocols on the same Socks4/Socks5 port with HTTP header filtering that generates fake identity-dependent headers every time the identity is changed (proxy chains are also supported), support for NTLM proxies, a User Interface that makes Tor's options and...
-
18
Easy265File
FFmpeg GUI. Easly preview the video & convert whole folder / videos
Use this program if you have a folder with lots of videos and you want to convert the entire folder to a new one with the same videos (but encoded differently). 1) Drag folder of videos to the GUI 2) By default, the new folder will be <input folder name>_Converted and it will be located next to the input folder. if you want to change the path, press the button with the 3 dots (under the "Output" tab...) 3) press the "Encode" button. NOTE: If the purpose is to compress the videos, don't change the command (Unless you know what you are doing). The default command designed to compress the videos very efficiently with almost no impact on the video quality! By default the program use the x265 (HEVC) encoder - the best algorithm for video compression! ... -
19
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... -
20
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.
-
21
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... -
22
(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. ... -
23
KeplerCentroidRoboVetter
Automatically provide centroid dispostions for Kepler KOIs
...The code finds signals otherwise incorrectly identified as planets in the Kepler Planet Candidate Catalogues. This part of the robovetter finds transit like signals on stars near the target, where the light spills into the aperture of the target star causing a false positive. The algorithm is documented in detail in Mullally et al (2015c), submitted to ApJ. The code can **not** be run. It uses as inputs intermediate products of the Kepler pipeline that are not made publicly available. The code is made available as detailed explanation of how the algorithm was implemented. ... -
24
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 ). -
25
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/.
