Search Results for "computer science projects"
Sort By:
33 projects for "computer science projects" with 2 filters applied:
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
Armadillo
fast C++ library for linear algebra & scientific computing
* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:... -
2
pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.
-
3
Bandicoot
fast C++ library for GPU linear algebra & scientific computing
* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive... -
4
javascript-algorithms
JavaScript implementations of computer science algorithms
javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts.... -
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
go-algorithms
Algorithms and data structures for golang
go-algorithms is an open-source educational repository that provides implementations of common algorithms and data structures written in the Go programming language. The project is designed primarily as a learning resource to help developers understand how fundamental computer science concepts can be implemented idiomatically in Go. It includes a wide range of classic sorting, searching, and numerical algorithms alongside basic collection structures such as stacks, queues, linked lists, and binary trees. The repository is organized into clear directories by topic, making it easy for learners to explore specific categories of algorithms. ... -
6
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
7
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
8
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not... -
9
GeoPDEs
A package for Isogeometric Analysis in Octave and Matlab
GeoPDEs is a suite of software tools for research on Isogeometric Analysis of PDEs. GeoPDEs is free software implemented in Octave and fully compatible with Matlab. GeoPDEs is no longer developed at SF, and has moved to GitHub. Please visit http://rafavzqz.github.io/geopdes/ The mailing list will remain active. Releases up to 2.0.4 can be found here. From version 2.1.0 onward, see https://github.com/rafavzqz/geopdes -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
10
Bat2015
Bachelor of Science (Informatik)
The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in... -
11
That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.
-
12
jmathstudio - Java Image/Signal toolkit
Java toolkit for discrete Image and Signal processing.
JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/ -
13
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer... -
14
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. -
15
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively,... -
16
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue... -
17
Sorting Algorithms
An educational demo of how sorting algorithms work.
...The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work. -
18
BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.
-
19
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
-
20
This projects has the intent to take any file that has a header and any number of lines, take out the blank lines, the carriage return and the line feed, given as delimitation the "project number" format and generates a new clean file.
-
21
Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.
-
22
Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI
-
23
A simulation environment for 2D robots to interact and perform tasks in. Meant to be educational and demonstrate emergent behaviors. No download necessary! See demos on project website!
-
24
-
25
The Distributed Genetic Programming Framework is a scalable Java genetic programming environment. It comes with an optional specialization for evolving assembler-syntax algorithms. The evolution can be performed in parallel in any computer network.
