Search Results for "problem a"

JUNGLE MATH Description: Jungle Math is a mathematical skill testing game specially for the kids. It's an educational software meant for all 32 bit and 64 bit Windows operating systems. Game instruction: Choose your level, solve the problem held by the girl and write the answer in the text box before she falls. You will get 1 point for solving each problem. With the points you earn you are given the choice to pick a gift at 5 point increments. A level will complete after completing 25 problems. If the girl falls to the bottom then one life is lost. If you lose three life then game is ended. ...

BLAST (Basic Local Alignment Search Tool) is a popular program that retrieves a library of sequences that resemble the query. The major problem experienced by new users of BLAST revolves around constructing syntactically and semantically correct command line, getting input files into acceptable formats and assessing the output. Visual BLAST is a Graphical User Interface written in C# and it was developed to simplify the parameters setting for BLAST searches. Visual BLAST aims to make BLAST searches accessible to a wider audience with no bioinformatics skill and to facilitate usage among the existing. ...

...An efficient alternative is the design and use of synthetic reference data sets to undertake black-box testing. These data sets should be generated in a manner consistent with the functional specification of the problem addressed by the method/software. According to this approach a data set generator was developed for the evaluation of preference disaggregation methods that are used for customer satisfaction analysis, like MUSA (Multicriteria Satisfaction Analysis).

Find the equilibrium condition for a commodity supply, transportation and demand problem.

...Oblikoskladenjsko označevanje je proces pripisovanja oblikoslovnih (in deloma skladenjskih) lastnosti besedam v poljubnem besedilu. Tako označeno besedilo je predpogoj za delovanje večine aplikacij, ki temeljijo na analizi naravnega jezika. Označevanje slovenskih besedil je zelo težak problem, saj mora algoritem za označevanje pravilno izbirati med skoraj dva tisoč oznakami (število različnih oznak za označevanje angleškega besedila je zgolj okoli šestdeset). Izvorna koda je na GitHub-u (glej Wiki). // The aim of the Obeliks project is to develop the most accurate statistical tagger for the Slovene language. Morphosyntactic tagging is the process of categorizing a word in a text into a particular part of speech category and describing it with various morphological features related to that category. ...

This small program allows you to enter two integers to return the aspect ratio. For example; HDTV uses a 16:9 aspect ratio, with common resolutions such as 1920x1080 or 1280x720. Have an obscure screen size? No problem! Enter the dimensions and hit enter to return the aspect ratio!

VRPSolver is a wizard-like application which solves a basic Vehicle Routing Problem (VRP) using the Savings Heuristic Method invented by Clarke and Wright in 1964.

These programs help math students succeed by offering semi-interactive interfaces. The calculator program is CLI or GUI based which allows a more personal experience. The Math Teachers is a GUI based interface that shows concepts.

PSPSolver (Project Scheduling Problem Solver) is a heuristic-based library for supporting the research on solvers for the RCPSP (Resource Constrained Scheduling Problem) providing an OO API for the visualization, representation, and solving of RCPSP

The bandit project is a repository of the various known algorithmic solutions for the multi-armed bandit problem. The project is also a repository of several datasets that could be used for benchmarking purposes.

It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.

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

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G