Search found 21 matches

by Moheeb
Fri Dec 22, 2006 4:46 pm
Forum: Algorithms
Topic: Classic matrix problem
Replies: 5
Views: 2874

Jan wrote
I think the best solution is O(n^3).
I don't think so, According to Bently there' exists sightly faster algorithm than this, though
i don't know that.
by Moheeb
Wed Sep 13, 2006 8:09 pm
Forum: C
Topic: execution speed improving..
Replies: 5
Views: 5436

[/quote] think the one influenced the speed of the program is the algorithm you use to solve that [quote] almost true . but there r so many ways to improve effeciency .u have to know ur particular machine architecture. plz look at the programming perls of John bently, one of the most beautiful book ...
by Moheeb
Sat Aug 12, 2006 9:40 pm
Forum: Volume 110 (11000-11099)
Topic: 11069 - A Graph Problem
Replies: 20
Views: 8914

edit
by Moheeb
Mon Jul 31, 2006 4:41 am
Forum: Off topic (General chit-chat)
Topic: Do you think your country is strong at IT and Programming?
Replies: 18
Views: 15490

//
by Moheeb
Fri Jul 28, 2006 6:43 pm
Forum: Off topic (General chit-chat)
Topic: Do you think your country is strong at IT and Programming?
Replies: 18
Views: 15490

Misof wrote: One possible source for programming contests performance stats: http://www.topcoder.com/stat?c=country_avg_rating[/quote] I don't think so ? more and less i hate programming contest , as it seems to me a football game , besides i am not a programmar , nor even a good student . I don't t...
by Moheeb
Fri Jul 28, 2006 6:41 pm
Forum: Off topic (General chit-chat)
Topic: Do you think your country is strong at IT and Programming?
Replies: 18
Views: 15490

One possible source for programming contests performance stats: http://www.topcoder.com/stat?c=country_avg_rating[/quote] I don't think so ? more and less i hate programming contest , as it seems to me a football game , besides i am not a programmar , nor even a good student . I don't think only the...
by Moheeb
Fri Jul 28, 2006 6:12 pm
Forum: Algorithms
Topic: Combinations
Replies: 7
Views: 2528

go to Donald E. Knuth homepage:

http://www-cs-faculty.stanford.edu/~knuth/news04.html

look at Pre-Fascicle2b: Generating all permutations

u will get more than what u need .

Happy hacking!
by Moheeb
Fri Jul 28, 2006 5:59 pm
Forum: Algorithms
Topic: longest path
Replies: 7
Views: 2549

Misof wrote: he intended formulation was "the problem is NP-hard and we don't know whether it is NP-complete". Sir , i am very poor in English . i don't understand what r u saying ? All NP-complete problems r NP-hard ,but some NP-hard problems r not known to be NP-complete . A problem L is NP-hard i...
by Moheeb
Fri Jul 28, 2006 5:58 pm
Forum: Algorithms
Topic: longest path
Replies: 7
Views: 2549

Misof wrote: he intended formulation was "the problem is NP-hard and we don't know whether it is NP-complete". Sir , i am very poor in English . i don't understand what r u saying ? All NP-complete problems r NP-hard ,but some NP-hard problems r not known to be NP-complete . A problem L is NP-hard i...
by Moheeb
Sun Jul 02, 2006 10:42 am
Forum: Algorithms
Topic: backpropagation algorithm and its solutioN
Replies: 5
Views: 1963

what's pack , i know it as back ,yeah it's used in neural network? I used it to
computing the weights of a MLP.


[/quote]
Do you mean the packpropagation algorithm which used in neural network?
by Moheeb
Sun Jul 02, 2006 10:39 am
Forum: Algorithms
Topic: backpropagation algorithm and its solutioN
Replies: 5
Views: 1963

what's pack , i know it as back ,yeah it's used in neural network? I used it to
computing the weights of a MLP.

Do you mean the packpropagation algorithm which used in neural network?[/quote]
by Moheeb
Sun Jul 02, 2006 10:37 am
Forum: Algorithms
Topic: backpropagation algorithm and its solutioN
Replies: 5
Views: 1963

Do you mean the packpropagation algorithm which used in neural network?

what's pack , i know it as back ,yeah it's used in neural network? I used it to
computing the weights of a MLP.
by Moheeb
Thu Jun 22, 2006 5:32 pm
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 61956

Dickon wrote: my code is always time limited, can someone give me suggestion? why u r doing the same thing again and again,? u can do lthe following: for(i =0 ;i<=10000;i++){ n=i*i + i + 41 ; flag[ i ] = prime ( n) ; // 1 if n is prime ,0 otherwise ; } now the rest is trivial ,do .... while( cin >>...
by Moheeb
Mon Jun 19, 2006 4:59 pm
Forum: Algorithms
Topic: bridge / critical links
Replies: 3
Views: 1696

Asif wrote:
Thnx misof. Just learned the name of CutVertex from you:). Before i dont know it.

Really ? u shouldn't go too far to know about it, look at Rosen's Discrete book,
section 8.4 , example 7 . BTW, this problem is really easy. :wink:
by Moheeb
Tue Jun 13, 2006 5:32 pm
Forum: Algorithms
Topic: Tell me about graph, help me
Replies: 4
Views: 2172

edit

Go to advanced search