上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 23 下一页
摘要: Congestion Avoidance in TCP Consequence of lack of congestion control When a popular resource is shared without regulation the result is always ove... 阅读全文
posted @ 2014-10-27 00:24 Ryan in C++ 阅读(1622) 评论(0) 推荐(0)
摘要: Studying TCP's Throughput and Goodput using NS What is Throughput Throughput is the amount of data received by the destination.The Average Throughput ... 阅读全文
posted @ 2014-10-26 23:50 Ryan in C++ 阅读(405) 评论(0) 推荐(0)
摘要: Studying TCP's Congestion Window using NS How to obtain TCP's CWND value The most important value that determine the behavior of TCP is the congestion... 阅读全文
posted @ 2014-10-26 23:12 Ryan in C++ 阅读(342) 评论(0) 推荐(0)
摘要: NS Simulation: Scheduling Events Simulation time A similation system (such as NS) must have a built-in simulation clock - it represents the "clock" ... 阅读全文
posted @ 2014-10-26 23:10 Ryan in C++ 阅读(283) 评论(0) 推荐(0)
摘要: 这个网站上的一系列讲解NS2的内容真的是深入浅出,看完立刻豁然开朗。所以就接连转了几篇。Scheduling Events那篇里的例子特别好,看完就懂了。http://www.mathcs.emory.edu/~cheung/Courses/558-old/Syllabus/90-NS/NS Sim... 阅读全文
posted @ 2014-10-26 23:07 Ryan in C++ 阅读(324) 评论(0) 推荐(0)
摘要: http://blog.csdn.net/kenden23/article/details/18696083本题是十分麻烦的题目,情况是非常多,网上也很多方法,其中最有效,优雅的方法是有限状态自动机(Finite automata machine)。其他一般方法都会十分复杂,而代码不能算优雅。为此我... 阅读全文
posted @ 2014-10-26 10:55 Ryan in C++ 阅读(239) 评论(0) 推荐(0)
摘要: Solution: when see question about two strings , DP should be considered first.We can abstract this question to calculate appear times for string T wit... 阅读全文
posted @ 2014-10-25 23:49 Ryan in C++ 阅读(344) 评论(0) 推荐(0)
摘要: 属于中规中矩的dp。和unique paths类似。一次ac。但是可以通过滚动数组来节省存储空间。 1 #include 2 #include 3 #include 4 using namespace std; 5 6 class Solution { 7 public: 8 int... 阅读全文
posted @ 2014-10-25 20:43 Ryan in C++ 阅读(301) 评论(0) 推荐(0)
摘要: 一维DP。 1 class Solution { 2 //Best time to buy and sell stock III 3 //correct one 4 public: 5 int maxProfit(vector &prices) { 6 if ... 阅读全文
posted @ 2014-10-23 09:32 Ryan in C++ 阅读(214) 评论(0) 推荐(0)
摘要: Greedy 1 class Solution 3 public: 4 int jump(int A[], int n) { 5 int start = 0; 6 int end = 0; 7 int count = 0; 8 ... 阅读全文
posted @ 2014-10-22 21:18 Ryan in C++ 阅读(166) 评论(0) 推荐(0)
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 23 下一页