摘要： The two page paper by John Nash made the cornerstone to game theory. Let's review what has been conveyed in this classic work. Nash argued that in n p 阅读全文

摘要： Suppose we are going to optimize a parameterized function $J(\theta)$, where $\theta \in \mathbb{R}^d$, for example, $\theta$ could be a neural net. M 阅读全文

摘要： First Let us review what is P, NP and NP complete. How to prove one problem is NP complete? Just need to show that the problem of interest can be redu 阅读全文

摘要： For recurrent relation with the following format: $T(n) = a T(\frac{n}{b}) + f(n)$ Let $c=\log_b a$ be the critical exponent . Master theorem compares 阅读全文

摘要： A very simple algorithm. print the cartesian product of n sets print_cartesian_product(list_of_sets): out_set=set() print_cartesian_product(list_of_se 阅读全文

摘要： MiniMax is another way of impleneting a simple AI for TicTacToe. Here is the code.package com.tictactoe;public class Point { int x; int y; Po... 阅读全文

摘要： TicTacToe 是一个很简单的棋盘游戏， 正因为如此， 即使是最直接的实现方式通常也能被很高效的执行。 下面是我自己写的一个简单的深度优先搜索的AI。貌似这是一个And/OR Tree ？package jp.co.worksap.global;import java.util.Arrays;i... 阅读全文

摘要： Latex 设置字体大小命令由小到大依次为：\tiny\scriptsize\footnotesize\small\normalsize\large\Large\LARGE\huge\Huge 阅读全文

摘要： 第二题：N*M cells in the bottom of a cage, each cell have a birld, it can be empty or a goose or a duck.you are given a String[] describe the cells, 'v' for a bird, '.' for empty.calculate the maximum number of goose there may have.The goose are placed with two restiction: 1. at least on 阅读全文

摘要： SAT boolean satisfication , first np complete problemSet coverin G=(V,E)minimum vertex cover, a special case of set covermaximum clique,maximum indepedent setwhat is the defnination of NP? NPC? NP-hard? whtat is the meaning of NP!=P or NP=P?How to prove a problem is NPC?oracle machine? or Turing mac 阅读全文