読み物 の変更点
Top / 読み物
- 追加された行はこの色です。
- 削除された行はこの色です。
- 読み物 へ行く。
- 読み物 の差分を削除
[[研究日誌とうめき]]
#contents
*論文、文献など [#lcb3b157]
-何をどれだけ読んだのか忘れそうなのでメモ
-2010/4以降のもの、元気があれば過去のものもまとめるかも
***CHR [#l041746e]
|年|進度|文献|メモ|h
|2009|ing|CHR Book||
|2010|ing|&ref(As Time Goes By : Constraint Handling Rules.pdf);|surbey|
|2006|2,3|&ref(Dijkstra's algorithm with Fibonacci.pdf);|dijkstra|
|2005|2,4|&ref(Analysing the CHR implementation of union find.pdf);|uf|
|2006||&ref(Deriving Quasi-Linear-Time Algorithms from Union-Find in CHR.pdf);|uf|
|2006||&ref(Optimal union-find in Constraint Handling Rules.pdf);|uf|
|2005||&ref(Logical rules for a lexicographic order constraint solver.pdf);|lex|
|2006|3|&ref(Complete propagation rules for lexicographic order constraints.pdf);|lex|
|2003||&ref(Extending Arbitrary Solvers with Constraint Handling Rules.pdf);||
|2005||&ref(The Computational Power and Complexity of Constraint Handling Rules.pdf);|TMやRAM|
|2006|2|&ref(Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees.pdf);|tree|
|1995||&ref(High-level implementations of constraint handling rules.pdf);||
|2007|all|&ref(A Concurrent CHR Implementation in Haskell with STM.pdf);||
|?||&ref(Indexing techniques for CHR based on program transformation.pdf);||
***その他 [#qdcac06b]
|年|進度|文献|メモ|h
|||Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms||
|||Programing by Multiset Transformation||
|||Floyd-Warshall All-Pairs Shortest Pairs Algorithm||
|||6.4 Warshall's Transitive Closure Algorithm|FW法の最適化|
|||単一始点最短路, 全点対間最短路||
|||NESL : A Nested Data-Parallel Language|マニュアル|