COMPGROUPS.NET | Search | Post Question | Groups | Stream | About | Register

### memtic algorithm

• Email
• Follow

```sir,

Is it possible to implement a memetic algorithm(parallel processing) problem in matlan
```
 0

See related articles to this posting

0 Replies
34 Views

Similar Articles

12/6/2013 11:17:32 PM
page loaded in 44742 ms. (0)

Similar Artilces:

A* algorithm
Hi , this is the program showing implementation of a* algorithm, given n integers and a sum m ,write a program to find the set of integers summing to m using a* algorithm. but i am not getting the o/p correct , i am getting only one set of integers, can any one point the errors/corrections required ? #include<stdio.h> #include<stdlib.h> #include<string.h> typedef enum {FALSE,TRUE}bln; int subsetsum(int*,int,int,bln* ,int); int compare(void*,void*); void printanswer(int*,int,bln*); int main(void) { int a[] = {5,3,4,8,9,6}; int sum = 15; int size...)) return TRUE; selected[i] = FALSE; } return FALSE; } void printanswer(int* a,int n,bln* selected) { int i; for(i=0;i<n;i++) if(selected[i]) printf("\t%d",a[i]); puts(""); } int compare(void* e1,void* e2) { return *(int*)e2 - *(int*)e1; } On Fri, 4 Apr 2008 09:11:58 -0700 (PDT), sulekhasweety@gmail.com wrote: >Hi , > >this is the program showing implementation of a* algorithm, given n >integers and a sum m ,write a program to find the set of integers >summing to m using a* algorithm. > >but i am

Tarjan algorithm
[First posted to comp.graphics.algorithms but seems inapropriate] Hi, Could you give me or tell me where can i find a step by step description of Tarjan's algorithm, the one which finds the strongly connected components of a directed graph ? I only know it performs a DFS (depth first search) and a vertex numbering. An applet would be suitable. Surpringly, a classical reference as Cormen and al doesn't deal with original Tarjan algorithm but rather with Kosaraju's algorithm. Thanks, Alex Al wrote: > [First posted to comp.graphics.algorithms but seems inapropriate] > > Hi, Could you give me or tell me where can i find a step by step > description of Tarjan's algorithm, the one which finds the strongly > connected components of a directed graph ? I only know it performs a DFS > (depth first search) and a vertex numbering. An applet would be suitable. > > Surpringly, a classical reference as Cormen and al doesn't deal with > original Tarjan algorithm but rather with Kosaraju's algorithm. > The even more classical book by Aho, Hopcroft and Ullman also uses Kosaraju's algorithm. It only mentions that Tarjan

Algorithm array
How do you add for loop data to a algorithm array. for k = 1:10 y(k) = 2*x + .01 x = .03*x end; %add to algorithm array called NumProcess

Search algorithm
Hello, I have to find algorithm which give me contractors whos the best matching to some conditions. Contractors are stored in DB and number of conditions is up to 20. Some conditions are importants then another. At this moment I have two algorithm: 1. Get all contractors from DB, iterate over set and give score for matching to conditions. At the end sort set (scores) and cut result to 100 contractors. 2.Make shot to DB for all conditions apart, get set contractor idenifiers, give scores for identifiers, maintain in memory HashMap<Identifier, Scores> after DB shot update table in memory. What do You thing about this solution. Have you any another idea ? Now I'm convinced do 2 solution because first seems to be slow. I will implement this in 3 layer aplication in Java language. Thanks in advance GG On Feb 12, 1:33=A0pm, gg <gi3...@gazeta.pl> wrote: > Hello, > > I have to find algorithm which > give me contractors whos the best matching to some conditions. > Contractors are stored in DB and number of conditions is up to 20. > Some conditions are importants then another. > > At this moment I have two algorithm: > > 1. > Get

Algorithm portability
Hello, I have a Delphi application that is supposed to produce enrcypted files that will be decrypted with JCE code on a server. I have tried a couple of cryptology-components for Delphi but I can't seem to successfully decrypt them. No problems encrypting/decrypting within Delphi or Java but interoperability seems to be the problem even if I seem to have all hash/algorithm/mode/padding stuff matched. Is it usually problematic to en/decrypt between different implementations of the same algorithms? Anyone have any working combination figured out for the Delphi/Java combination? Thanks in advance, Nik Nicklas Karlsson wrote: > Hello, > > I have a Delphi application that is supposed to produce enrcypted > files that will be decrypted with JCE code on a server. I have tried a > couple of cryptology-components for Delphi but I can't seem to > successfully decrypt them. No problems encrypting/decrypting within > Delphi or Java but interoperability seems to be the problem even if I > seem to have all hash/algorithm/mode/padding stuff matched. > > Is it usually problematic to en/decrypt between different > implementations of the same

RETE algorithm
CLOS might > be in order but if there is something already out there... You can find the original OPS5 interpreter using the RETE algorithm as implemented by Charles Forgy, at CMU's AI repository. This was done in Franz Lisp. There is also a Common Lisp version based on the original Franz Lisp OPS5 interpreter at the same site. See link below: http://www-cgi.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/syste ms/ops5/ I've been looking around and have not found any Scheme code for the RETE algorithm. I also plan on putting a Scheme version together. I plan... the MIT AI Lab in the late 80s or early 90s. He showed how to derive the Rete algorithm by a series of program transformations from a very simple initial specification. I believe that he formulated it all in Scheme (though it may have been Common Lisp) and he may have implemented each stage in the transformation. He can be reached at ITA Software. "Ray" <ray@nospamme.com> wrote in message news:<pan.2004.01.22.00.04.11.87912@nospamme.com>... > I was actively working on one as recently as 10 days and stopped. My main > concerns being speed, scalability and memory

searching algorithm
letter. For most letters, this can be carried on > another level. Here's a proof of concept prototype of the dictionary searching algorithm. The dictionary I found to test with has roughly 5,000 words, and I didn't attempt any optimizations at all. I'm guessing it can't be sped up very much, even though I wrote the simplest possible implementation. Lookup in the worst case is O(N), where N is the number of letters in your prefix. First, a sample of input/output. lookup: pe people: la gente[Noun] pepper: pepe[Noun] peppercorn: grano di pepe[Noun] peppermint: menta

What-if algorithm
In excel you have a menu function that consist of given one cell input and one cell output no matter how are related one to other, you could search for the input that correspond to a given value of the output. That is, if I set \$input and have a (complicated) \$output = f ( \$input ); I can search in the reverse direction for a solution to \$output = XXX; Do you know the subyacent algorithm or module to cover this? TIA -- http://www.telecable.es/personales/gamo/ "Was it a car or a cat I saw?" perl -E 'say 111_111_111**2;' gamo wrote: > > In excel you have a menu function that consist of given one cell > input and one cell output no matter how are related one to other, you > could search for the input that correspond to a given value of the > output. > > That is, if I set \$input and have a (complicated) \$output = f ( > \$input ); I can search in the reverse direction for a solution to > \$output = XXX; > > Do you know the subyacent algorithm or module to cover this? If I understand your question correctly, this will not always be possible. There may be more than 1 input to the function that will give a particular

Genetic Algorithm
Hey ppl, Whats the best way to implement genetic algorithm? Like i need to use genetic algorithm for the map coloring problem with three regions and three spaces and three regions and four spaces and also have to use a "repair" operator for mutation issues. Should i use Matlab or PROLOG? I'm new to both so would like some advice. Thanx. abhi

SOM Algorithm ??
I've developed a selforganizing topic map using the following algorithm. http://java.sun.com/applets/jdk/1.0/demo/GraphLayout/example1.html Now I'm not sure whether this algorithm is a SOM Algorithm developed by T. Kohonen or is it something like a Bayesian Network Algorithm in combination with the SOM? Does anyone know? Thanks. The method used in the mentioned applet has nothing to do with Kohonen's SOM or Bayesian network. But, I don't know the real origin of this algorithm. The method looks similar to the method of force directed layout. You can do a google search on these keywords to find more informational about the latter. James X. LI -- -------------------------------------------- VisuMap Technologies Web: http://www.VisuMap.net Email: JamesXLi at VisuMap dot net === Developing visualization software for high dimensional data === "Nadine" <NadineAmende@web.de> wrote in message news:61c6b2b6.0310100506.48d73cbf@posting.google.com... > I've developed a selforganizing topic map using the following > algorithm. > > http://java.sun.com/applets/jdk/1.0/demo/GraphLayout/example1.html > > Now I'm not sure