4816 search results - page 477 / 964 » Performance analysis of the AntNet algorithm |
151
click to vote
ICONIP
2007
15 years 8 months ago
2007
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
148
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
168
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
203
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
180
click to vote
TCS
2010
15 years 5 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...