Search Results for "problem a" - Page 69

this is a project for the computer vision class. We intend to track multi-targets while preserving the identity of the targets. We propose to represent this as a Flow optimization problem and solve it using K-shortest path algorithm.

This is the first coding challenge in a monthly series by Dice News. We're looking for you to write a computer program in C#, C++ or Java to solve a programming problem. If you want to enter, you must submit your code via email to dhbolton@hotmail.com with the subject "Dice Coding Challenge 1" between Oct. 1 and Oct. 31, 2013. The Problem: Consider all the nine digit integers where each digit 1-9 occurs only once. The lowest of these numbers is 123456789, the next is 123456798 and the highest is 987654321. ...

Microg is an amazing app for android users because it replaces the problem of Google Play services. Those people who don’t want to share their data with the company then they should install Microg apk. It’s free and open-source software that allows all the apps to run on the systems where Google play services are not available.

My algorithm which solves The Salesman Problem with neighborhoods written in C# with visualisation.

Project is aimed to solve standard the so called "Travelling Salesman Problem".

-NIB's Solution to Military RP- CommonwealthCore (CC) is a database application with an easy to use interface. It is written in C++ for Microsoft Windows operating systems. (Not compatible with Linux/Unix and Apple OS's) It is designed to solve the problem of extensive and tedious factbooking with Military Role Play. It is available to all members of The Military Commonwealth.

Semestral work. Paralyzed horse movement problem.

Heuristic Algorithm developed in C language to solve Knight's Tour Problem across standard 8x8 chess board.

Bellman algorithm's to resolve binary knapsack problem.

Have you ever had this happen to you? You notice a problem with your network, and though you have lots of management tools running, querying ports and visualizing data, but either just that exact port you need hasn't been added to your NMS, or the data stored does not cover the detail you need, or has been compressed to compensate for outrageous space requirements ... HIDS SNMP Manager attempts to solve this problem for you.

CAEBeans is the hierarchy of problem-oriented shells over CAE-package. Their functionality is implemented using GPE (Grid Programming Environment) architecture.

Model-based AI planner using binary decision diagrams. PropPlan parses PDDL descriptions of the domain and the problem, and outputs a plan.

Locational mobile mashup web based portal to solve the "What is there to do right now?" problem.

...The issue is that the output of script is a plaintext “typescript” file that can be very hard to read, and gets harder to read as the file size increases. Forenscript aims to solve this problem by providing the user with a front-end that makes navigating and parsing the script output file easier, while also allowing users to export only important contents to a new file for future use.

This project want to construct the tool for the following means. 1*Management of project 2*Finding of problem 3*Progress rate etc.

This project is aimed at graph traversal by Random walk problem.

...A normal HTML + JavaScript + CSS site can be simple, beautiful, and enough for lots of things. You use PHP because you don't want to copy your menu or your header? It's not a problem! Use precML instead! Build your webpage with some special XML tags, run the compiler, and it'll generate everything else for you! Are you interested? If so, then go to our project wiki!

A tool to collect problem information, develop hypothesis, create research, and influence policy.

HanoiME is a popular game "Tower of Hanoi" for mobile (javaME). At different level one can play with increasing number of disks. The game play helps to master the technique of solving tower of hanoi problem.

Jan-v1-edge is a lightweight agentic language model developed by JanHQ, designed for fast and reliable on-device execution. It is the second release in the Jan Family and was distilled from the larger Jan-v1 model, retaining strong reasoning and problem-solving capabilities while reducing its computational footprint. The model was refined through a two-stage post-training process: Supervised Fine-Tuning (SFT) to transfer knowledge from Jan-v1, followed by Reinforcement Learning with Verifiable Rewards (RLVR) to optimize reasoning, tool use, and correctness. With just 1.7B parameters, Jan-v1-edge achieves 83% accuracy on SimpleQA tasks, approaching the performance of larger models like Jan-nano-128k. ...

...Using the data that a user enters when he or she creates an account, we can find users with similar tastes who have tried other nearby restaurants and use these correlations to predict which restaurants the user will enjoy. Preferate will also be able to use these same techniques for groups of people, to eliminate the problem of fighting over what restaurant to go to.

Keeping up with multiple, high traffic, mailing lists can be a fool's errand. Machine learning and automatic text classification have for many years promised a better solution to this problem. This project seeks to put that promise to the test.

DataDigger is a simple text fetch tools.We can use it to fetch aims from text data by template,or config taglibs for template. DataDigger is a baby,we are keep updating.If problem,please contract with bianrongjun@gmail.com or visit www.nobject.org

This is a simulation of Elevator (LIFT) problem. This project is coded entirely in C++ and using object oriented approach.

A java command-line application where the main goal is to solve any simplex problem. It's a team-work school project. It can be usefull for other students who needs to understand the simplex algorithm.