zoukankan      html  css  js  c++  java
  • TODO List

    1. LCEPI summary
      Quick Sort: in C and in Haskell

    2. G's slides

      NP-Complete: salesmanknapsack(encrypted)
        http://blog.csdn.net/liyangbing315/article/details/5563790
        Salesman: enumeration solution: n!. DP: n^2 * 2^n
        encrypted knapsack problem is NP-Complete. 01-KnapsackComplete-Knapsack is not (classic DP).
      Algorithm:  A*: http://www.cnblogs.com/technology/archive/2011/05/26/2058842.html
              For each node: f = g(actual) + h(estimated). Everytime we pick min f.
            IDA*: http://blog.csdn.net/urecvbnkuhbh_54245df/article/details/5856756
              To avoid hashsorting in A*: like a water-level control based pruning strategy(on h())
            Sorting proscons
      Combinatorics: k out of n
      Graph: data structure's proscons (pointers, matrix, adjacent list)
      OS: process vs threads: http://www.360doc.com/content/09/1204/02/536925_10319687.shtml
        Threads share global valmemcode.
      System Design: network basics: router, DNS, load balancer, firewalls etc.
      TCPIP: general knowledge http://www.baike.com/wiki/TCP%2FIP%E5%8D%8F%E8%AE%AE
      Papers: Google SpannerChubby

    3. My own resume

    4. Misc.

      Binary tree problems:
      http://www.cppblog.com/flyinghearts/archive/2014/07/12/166713.html


      LCA problem:
      http://baozitraining.org/blog/binary-tree-common-anncestor/
      *http://taop.marchtea.com/03.03.html

  • 相关阅读:
    .OBJ est1.axf: Error: L6230W: Ignoring --entry command. Cannot find argumen 'Reset_Handler'
    线程详细剖析(四)
    线程详细剖析(三)
    线程详细剖析(二)
    线程详细剖析(一)
    CAN总线相关的几个gitlab代码
    进程详细剖析(三)
    C++实现多级排序
    C/C++读写二进制文件
    C++11新特性
  • 原文地址:https://www.cnblogs.com/tonix/p/4066309.html
Copyright © 2011-2022 走看看