First Search
Advertisement
Swirlique v.3.060.041110
Swirlique draws and animates Kleinian limit sets, using the "depth-first search" algorithm and two-generator group "recipes", as illustrated in the book Indra's Pearls, (c) 2002 Cambridge University Press. Swirlique also exports Kleinian sets in 3D format ...
Advertisement
JCompoundMapper v.Beta
jCompoundMapper provides popular fingerprinting algorithms for chemical graphs such as depth-first search fingerprints, shortest-path fingerprints, extended connectivity fingerprints, autocorrelation fingerprints (e.g. CATS2D), radial fingerprints (e.
Musiz v.1.3.0.0
The first search result is the artist who has tried the other ones are similar
2. Improved automatic search based on the mp3 found in the phone
3. Under the "Bio" of the artist you can access the Marketplace to listen to some tracks
4. In ...
Anysearchtime v.15.7.8.3
The First Search Term has many more characters.
There is an option to use a Reference Table to find search categories in a compressed form. Locating search categories can also be found by using a TOPIC LISTINGS routine. A Suggestions routine ...
SearchMaestro v.1. 3. 2000
So after the first search you save time because a complete file list has already been created; SearchMaestro only needs to check each file and folder against the new or modified search parameters you have specified. You can add files and folders into ...
JavaFX Game- Link Up v.1.0
A breadth-first search algorithm is used to find the shortest path. Check the code at Model.fx, there are three functions: findNoCross(),
findOneCross() and findTwoCross() implemented for this purpose. The first function finds a set of cells that ...
Shout Scan PLS ASX M3U v.2. 2. 2001
Shout Scan has been updated and tested with JAWS to be very accessible using most screen readers!
Choose a specific genre to be downloaded!
Select the minimum bitrate and/or maximum bitrate of stations to be downloaded!
Download Stations with highest bitrate first!
Search for ...
J-Algo v.1.01 Build 20110712
BFS/DFS: breadth-first search and depth-first search in graphs
6. C0-H0: translation of C0 into H0 programs
7. Dijkstra algorithm: create directed graphs and perform Dijkstra's algorithm to find the shortest way
8. EBNF/syntax diagrams: EBNF ...
Paste Middle And Go v.0.1.3.2
When you middle click on the "new-tab" button (usualy on the right of your tab bar),
this tiny extension will load the URL contained in your clipoard or if it doesnt recognise it as an url, it will launch your first search engine.Requirements:
* ...
ShoutScan v.1.21
* Choose a specific genre to be downloaded!
* Select the minimum bitrate and/or maximum bitrate of stations to be downloaded!
* Download Stations with highest bitrate first!
* Search for specific Stations by name or description of music!
* ...
Apriori v.5.67
1993), which carries out a breadth first search on the subset lattice and determines the support of item sets by subset tests. This is a pretty fast implementation that uses a prefix tree to organize the counters for the item sets.usage: apriori.exe ...
Eclat v.3.73
Eclat help you find frequent item sets (also closed and maximal) with the eclat algorithm, which carries out a depth first search on the subset lattice and determines the support of item sets by intersecting transaction lists.
The current version ...
WordLadders v.1.0
The search algorithm is quite fast and uses a heuristically guided (sort of iterative) depth first search. As well as getting a ladder between two words, the software can generate a ladder from a start word to a depth you specify. No words will be repeated ...
File by OCR v.4.0
When setting the program up the user should take into consideration that OCR technology is not 100 percent accurate and capture enough data so that they can be assured that if the document is not found on the first search it can be found on a subsequent ...