i am working on project of using ant colony optimization and espcially on antnet algorithm but i have many problems in programming of this algorithm, and since i dont perfer using simulation for that purpose.
View 4 RepliesI want to write a simple beam search algorithm to solve a maze (like a tree, and the output must be the shortest path).So, if anyone have tried to write a beam search algorithm before, preferably in VB.NET language, it would be great if you can share it in a pseudo-code format.
Because, I have no idea on how to write the algorithm. I have tried to Google it, but I understand nothing.I found this source though (which I don't understand at all XD) [URL]..So, back to my question, how to write a beam search algorithm? Preferably, in VB.NET language and pseudo-code will be enough for me (an actual example code will be great though
WHERE IS MY Problem. Develop a COMPLETE algorithm using pseudo code to solve the following problem: Your network contains hundreds of workstations. The primary local drive (C on each of those workstations may contain many folders immediately under the root folder. You need to search each of the folders under the root folder on each of the workstations to see if the file nasty.bug exists. You need to do two things with respect to this file. First, count the number of times this file is actually found and, after all the workstations have been scanned, display a message indicating the total number of occurrences of this file across your network. Second, whenever the file is found, it should be deleted.
View 1 RepliesFor a school project we need to visualise a computer network graph. The number of computers with specific properties are read from an XML file, and then a graph should be created. Ad random computers are added and removed.Is there any open source project or algorithm that could help us visualising this in VB.net? Or would you suggest us to switch to java.
Update: We eventually switched java and used the Jung libraries because this was easier for us to understand and implement.
I am trying to write a code about counting inversion algorithm.I finished the code but the result was wrong..I dont no where is the problem but I think it is in the count-merg function [code]
View 2 RepliesI have a standard scoring algorithm but I need to help on a piece of code to only execute the scoring algorithm at certain times.I want it to be triggered by dates, but the problem arises if the program is used after 2 (or more) dates have passed, the first date will not be added as the second date is the newest and therefore the one that triggers the scoring algorithm. - The scoring algorithm gets the scores for that week, which are stored in a text file.
View 5 RepliesI want to find a way to speed up this code.if you look at the condition of If calculated Then in the code below, this is what slowing down the code.While the code provided seem fast with Const initBit = 4 try it with something over 12.
I want to be able to use this code (with calculated param as True) with initBit of 20 or more.
Beware that 20 or more might require a gig or more of ram and/or compiled as x64.
C# code (converted with an online tool from VB.NET):
[Code]...
I am trying to implement an Algorithm called "Diamond-Square Algorithm" I am having trouble ending it so that it retiurns the required result. So far I have the folloiwng.
[Code]...
I'll do my best to explain what the algorithm is supposed to do:There's a class 'Recipe'.ach Recipe can include other Recipes but cannot include itself or any other Recipe that includes it. So, a simple example is we have just two Recipes A & B.A,B,C(1) Recipe C Adds B(2) Recipe B Adds A(3) Recipe attempts to add C, but can't because of the relationship. C- B - A.
View 4 RepliesI'm Micah. Electrical/Electronic engineering 500 level student. I'm working on my final year project. please i need a code for the implementation of RSA algorithm in VB.NET. your assistance will be appreciated.
View 2 Repliesis the algorithm for VB editor released anywhere? because i'm trying to create my own editor that gives various options like Linking and self defined array functions (see below) such that one edit can update several others in various places, but i do still wish to have the auto formatting VB editor provides us with.an example of a self defined array function (count):we can transform this:
Public Class test
Private Shared number_of_methods As Integer = 2
Public Function get_number_of_methods_juz_an_example() As Integer
Return number_of_methods
[code]....
well of course instead of the code it would be just click and select (i wrote out the code in <> just to show what's happening)
i need some tutorial to implement BLS (Boneh-Lynn-Shacham) signature algorithm to create private key and public key to encrypt a message.I need tutorial to implement this in VB.NET.
View 1 RepliesI found an algorithm in C# that I need to convert to C. Problem is, I have never used C# so the syntax is really strange to me.
Implementation of Berlekamp-Massey algorithm for calculating linear complexity of binary sequence
s = byte array with binary sequence
returns Length of LFSR with smallest length which generates s
[Code].....
I want create my own algorithm
View 1 RepliesHow would I be able to use my own Encryption Algorithm in my program such as encrypting text. I havn't been able to figure this out.
View 1 Repliescan you write an algorithm which can calculate 500 factorial.scientific symbol(mode) is unauthorized.Answer should be in String mode.
View 1 RepliesI am using VB.NET and I am trying to come up with some algorithm or some pseudo-code, or some VB.NET code that will let me do the following (hopefully I can explain this well):I have 2 collection objects, Cob1 and Cob2. These collection objects store objects that implement an interface called ICob. ICob has 3 properties. A boolean IsSelected property, a property called Length, which returns a TimeSpan, and a Rating property, which is a short integer.
OK, now Cob1 has about 100 objects stored in the collection and Cob2 is an empty collection. What I want to do is select objects from Cob1 and copy them over to Cob2. I want the following rules obeyed when selecting the objects though:
[Code]...
[code...]
So far, my friend has this, and we're trying to figure out how to get the code to tell convert F to C, and back. All we can use for input is (example:) 10,f and it will change it to 40,C.
Forgive me if this is a silly question....but I think back to my Comp. Sci. classes and I distinctly remember learning/being quizzed on several sorting algorithms and the corresponding 'Big O' notation.
Outside of the classroom though, I've never actually written code to sort. When I get results from a database, I use 'Order By'. Otherwise, I use a collection class that implements a sort. I have implemented IComparable to allow sorting; but I've never gone beyond that.Was sorting always just an academic pursuit for those of us who don't implement languages/frameworks? Or is it just that modern languages running on modern hardware make it a trivial detail to worry about?
Finally, when I call .Sort on a List(Of String), for example, what sort algorithm is being used under the hood?
I'm trying to convert the following algorithm from C# to VB.NET and the VB.NET I have is not producing the same results as my C# algorithm, can someone tell me where I've gone wrong in my conversion?
public static IEnumerable<T[]> Combinations<T>(this IEnumerable<T> elements, int k)
{
List<T[]> result = new List<T[]>();
[code]....
I need to encrypt vbs file using a cryptographic algorithm. I read about converting it into vbe file, but is there any other way to do it?
View 1 RepliesI have visual studio 2008, and we have been given specific tasks to carry our for our course, we have been asked to implement euclid's algorithm by using a while loop, doing so without the visual part of visual basic whatever that means an example of a question they gave was 1)HCF(88,26)=2 how I would go about doing this, as I am thoroughly confused, and deadlines are fast approaching.
View 3 RepliesI have some text files that contain
<img width="100" or
<img width="1400" or....
How could i replace all above with the following, since the image width is not static?
<img width="200"
i want to implement bankers algorithm in vb.net how can i implement it
View 1 RepliesI am struggling to write a sorting algorithm that can sort characters in a word lexicographically (alphabetically) as follows
lexicographical sort of the word :- Contamination
lexicographically
Sorted Text Index
[code]....
write a pseudo code / or an implementation in C# or VB.NET of how I can do a lexicographical sort of the word above?
I am trying to pair numbers, like for a tournament. I need an idea for the algorithm to pair up the numbers, not the code, but the algorithm.
View 1 RepliesSearching the internet for an example of backtracking in VB.Net has proven fruitless. All the examples I found were either in a language I don't understand (making it impossible for me to convert it to vb.net) or they contained zero commenting (making it difficult to actually understand what is going on).Does anyone have an example of backtracking in VB.Net? Commenting would be useful so I don't have to decipher single letter variables.
View 16 RepliesI am currently developing a advanced web browser in Visual Studio 2008. I was reading information about a browser i currently use, it said that the browser goes faster thanks to a "advanced cache algorithm". I was wondering if it was possible to implement this into my web browser, and if so how would i do so? I am using Visual Studio 2008 writing in .Net.
View 3 Replieswhich algorithm used for voice compression mailing and decompression
View 2 RepliesI have decided to use a flood fill algorithm for my application, using this pseudo-code from Wikipedia:Flood-fill (node, target-color, replacement-color):
1. Set Q to the empty queue.
2. If the color of node is not equal to target-color, return.
3. Add node to Q.
4. For each element n of Q:
5. If the color of n is equal to target-color:
6. Set w and e equal to n.
7. Move w to the west until the color of the node to the west of w no longer matches target-color.
8. Move e to the east until the color of the node to the east of e no longer matches target-color.
9. Set the color of nodes between w and e to replacement-color.
10. For each node n between w and e:
11. If the color of the node to the north of n is target-color, add that node to Q.If the color of the node to the south of n is target-color, add that node to Q.
12. Continue looping until Q is exhausted.
13. Return.
I was doing alright, until I hit the "continue looping until Q is exhausted".I don't quite get that.