The algorithm is the perceptron algorithm. I believe it can be cast as gradient descent.sclo wrote:the method looks like gradient descent, but I don't know what function it is trying to minimize.
Search found 194 matches
- Mon Oct 08, 2007 6:48 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11289 - Friend or Foe?
- Replies: 8
- Views: 3841
- Fri Oct 05, 2007 10:29 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Fri Oct 05, 2007 9:51 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Fri Oct 05, 2007 9:41 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Fri Oct 05, 2007 9:27 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Fri Oct 05, 2007 8:49 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Fri Oct 05, 2007 8:32 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Fri Oct 05, 2007 8:22 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 11549
- Mon Oct 01, 2007 3:48 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11293 - Tournament
- Replies: 19
- Views: 8526
- Mon Oct 01, 2007 1:22 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11293 - Tournament
- Replies: 19
- Views: 8526
Re: 11293 - Tournament
Now if, for example, A plays B, the winner plays C, and the winner plays D, we have the case that A needs to play in 3 events to win. So it is not true that no knight must compete in more than 2 events, because A must. So this second schedule fails to maximize e.
Well, 4 knights, A, B, C, D. A ...
- Mon Oct 01, 2007 12:20 am
- Forum: Volume 112 (11200-11299)
- Topic: 11293 - Tournament
- Replies: 19
- Views: 8526
Re: 11293 - Tournament
The problem states..
The tournament schedule is organized so that no knight needs to compete in more than e events to be champion, for the minimum possible e given k, the number of knights.
The minimum possible e should be always 1. So, the number of knights can be reduced to 2. Am I right or I ...
The tournament schedule is organized so that no knight needs to compete in more than e events to be champion, for the minimum possible e given k, the number of knights.
The minimum possible e should be always 1. So, the number of knights can be reduced to 2. Am I right or I ...
- Sun Oct 08, 2006 4:32 am
- Forum: Algorithms
- Topic: Suffix Tree and some application
- Replies: 1
- Views: 2323
Re: Suffix Tree and some application
11107 Life Formsrushel wrote:Hi guys i want to learn suffix tree and also want to see some suffix application.
please guys help me i badly need it.
10526 Intellectual Property
10580 Ransom Note
- Sat Oct 07, 2006 3:10 am
- Forum: Volume 111 (11100-11199)
- Topic: 11102 - Moonshine
- Replies: 27
- Views: 14069
- Thu Oct 05, 2006 5:26 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11102 - Moonshine
- Replies: 27
- Views: 14069
- Thu Oct 05, 2006 11:03 am
- Forum: Volume 111 (11100-11199)
- Topic: 11102 - Moonshine
- Replies: 27
- Views: 14069
Re: 11102 Moonshine WA
Please help me, i tested it with several test case, but it was WA
here is my code
thanks
Not sure what you are doing but I don't see any code that integrates to find the volume of a cone sliced by a plane parallel to its axis. This integral is nasty. Dr. Math has an incorrect solution and I have ...
here is my code
thanks
Not sure what you are doing but I don't see any code that integrates to find the volume of a cone sliced by a plane parallel to its axis. This integral is nasty. Dr. Math has an incorrect solution and I have ...