SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst its space complexity is O(1). This algorithm checks two characters at a time. In best case where the substring is at the start of the text, we can check all the character of substring in only m/2 time. In worst case where the substring is at the last of the text, we need to iterate till n – m For more information please visit the following link:- http://learandexperiment.blogspot.in
SMSCompress is a project of investigation, development and implementation of different SMS compression techniques. Using these techniques, SMS of more than 160 characters can be sent at only one SMS, saving money to the user ;)
Search Agent is a .NET application that help you to build a local/distributed search engine with mltiagents system, Linguistic Analysis,... This project uses a WebService and an ASP.NET website to communicate with User application.
北邮传感网络 The research of sensory networks in BUPT, Beijing, China!
Solving the Travelling Salesman problem is not our objective. We are writing an algorithm which will sort out the traffic woes of transport companies. In turn, it will help in saving traveling cost and time for the people involved and the transport compa
Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. NO tool is providing a global framework to develop algorithms. Silicis is a new formal framework for designing [verification] algorithms.
PHP Library for creating and running Kohonen Neural Networks'
Software Engineering project. Prototype of a navigation system simulator.
Develop algorithms and software to speed communications, compress files, save disk space and band width and enable much faster file sharing. Use hashing and encryption to overcome problems and enable users to share multiple files simultaneously.
SphinxAIEngineis an open source AI engine. for researching morden AI technical. including for eg Bahviours Tree, Pathfinding .
This project will host the implementation of Stanford GraphBase Library (Donald E. Knuth) in Modern C++ using boost and beyond in headers-only library.
Project that will provide implementations in Java's Micro Edition (J2ME) platform of algorithms on strings, for exact/inexact matching, similarity distances, among others.
A generic library of swarm intelligence algorithms for general use. This project is currently being developed in cooperation between De Montfort University, UK and Georg-Simon-Ohm-Hochschule, Germany under Dr. Aladdin Ayesh supervision.
Centre is a synthetic trajectory generator environment that aim to generate semantic-based trajectory datasets usable for spatio-temporal data-mining algorithms in testing and validation process.
This project attempts to host the complete re-write of all the programs(including exercises too) of the seminal volumes of The Art of Computer Programming by Donald E. Knuth in modern C++, mostly using boost in a header-only C++ library.
My algorithm which solves The Salesman Problem with neighborhoods written in C# with visualisation.
TZOTZ IS AN ALGORITHM OF SECURITY TO AVOID COLLISIONS BETWEEN TRAINS (UNDER LICENSE MIT) TZOTZ ES UN ALGORITMO DE SEGURIDAD PARA EVITAR COLISIONES ENTRE TRENES (BAJO LICENCIA MIT)
A tutorial, using NeHe's code as a base, to trace a ray, perform a shortest path algorithm, find points relative to the screen, and other things. This will eventually become a rpg tactics game with the use of OpenGL.
Tallen is my first try to create an artificial entity, by using the latest findings.
TALLA AUTOMÁTICA DE PIES PARA AJUSTE DE CALZADO
DOCUMENTACIÓN A PRESENTAR. 1. Memoria preliminar describiendo la tecnología a utilizar y su justificación, planificación de las tareas a realizar y distribución de dichas tareas entre los miembros del grupo. 2. Ejecutable que cumpla los requisitos establecidos en la memoria. 3. Memoria final del proyecto, en el que se incluirá: a. Descripción de la tecnología utilizada y, en el caso de que no coincida con la establecida en la memoria preliminar, justificar el cambio. b. Descripción de los costes computacionales y requisitos tecnológicos. c. Manual de usuario del programa desarrollado. FASES 1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto). 2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos) (límite: 23 de mayo). 3. Presentación del trabajo (2 puntos) (28 de mayo).
In the field of technical analyis of stock trends, there are numerous, sometimes contradictory theories regarding buy and sell signals. It is the aim of this project to develop a system that takes historical data and returns the best possible strategy.
Ky eshte nje projekt i HAPUR/FALAS per publikun Shqip-foles i cili permban nje seri Video-Kursesh, Udhezime, dhe Shembuj Kodi per gjuhe (web) si: XHTML, CSS, JS, PHP, AS3 etj. si dhe per Desktop: C++, Java, Adobe Air etj. + programe/praktika te ndryshme.
Implementations of various algorithms using CUDA.
This project has moved. Please follow the WWW link below.
The "HoldemHand" project will be able to provide odds for Texas Holdem hands. This project will be able to provide the user with statistical data about the odds and possibilities of Texas Holdem Poker hands.