블로그
- Breaking the Sorting Barrier for Directed Single-Source Shortest Paths We give a deterministic -time algorithm for single-source shortest paths (SSSP) on directed graphs with This is the first result to break the time bound of Dijkstra's algorithm on sparse graphs, showing that
- 21년 APISAT ,추계항공 노트 element 특허출원중 hurmitz lyapunov equation mtow : maximum takeoff weight psga: particle swam genetic algorithm 4.5e+6w/m2 heat flux to our best of knowledge. 1month calculatio time for optimize (global searching
- 3. File Programming Disk Structure * Disk access : Sector addressing 방식을 사용 ① Seek time : move head to appropriate track ② Rotational latency : wait for the sector to appear under the head ③ Transmission time : read/write
- [TED] 제레미 하워드(Jeremy Howard): 컴퓨터 학습이 가져올 훌륭하고도 끔찍한 잠재적 효과 (사진 출처: www.ted.com) 제레미 하워드(Jeremy Howard): 컴퓨터 학습이 가져올 훌륭하고도 끔찍한 잠재적 효과 Deep learning is an algorithm The more data you give it and the more computation time you give it, the better it gets.
- Expression efficiency of the algorithm , which measures the processing time and computer memory required by the algorithm to solve problems closely approximate the time required to solve a problem of size n by multiplying the previous time
- quick sort(퀵 정렬) quick sort(퀵 정렬) -divide and conquer- [introduction to algorithms] The quick-sort algorithm has a worst-case running time of Θ(n²) on an input array of n numbers.
- PageRank Algorithm PageRank From Wikipedia, the free encyclopedia (Redirected from PageRank Algorithm) Jump to: navigation with 15% likelihood jumps to a random page on the whole web) is going to be on Page E for 8.1% of the time