Search Results for "space"

Library to enable user space application programs to communicate with USB devices

Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.

Mostly WYSIWYG command-line driven editor with editable commands, a powerful macro facility including a stack architecture run machine, macro debugger, online help, a foundation macro set and extension macro sets for C, python, Ada and Tcl development and email composition. Q tries to resolve the old tabs vs spaces conundrum: e.g. in Linux source, the user can automatically enforce leading tabs, no space-before-tab leading sequences and no trailing spaces.

It's a very light Redhat Linux and Oracle OVM System Performance Monitoring tool written in Perl using rrdtool for Database and Graphing. Allows you to query the RRD database given a set of dates and generates a web based graphs. Easy to install. Uses less disk space than most performance monitoring tool. Data of each host monitored is kept for 2 years and occupy less that 25 MB of disk space.

Inotifyfs is a set of scripts, primarily on bash to allow user keep remote and local folders synced in real time in efficient way based on inotify kernel evens and function in user space.

...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. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases best, average and worst its space complexity is O(1). For more information please visit the following link :- http://learandexperiment.blogspot.in

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. ...

WebGoo is the Internet browser was working from 1999 and was named as the first Net-M@X been changed its name to WebGoo and program development program has been programmed to open more than one location and shake the idea was basically add additional

Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.

(Moved to http://code.google.com/p/igb/) Vigo::3D is a library for multi-agent simulation and visualization in 3D space.