-
由 Razvan Pascanu 提交于
The main thing I was looking for was efficiency. The new algorithm is not recursive, it considers a bunch of outputs at the same time, and it uses toposort to traverse the graph, making sure each node is seen only once.
82efd74e
The main thing I was looking for was efficiency. The new algorithm is not recursive, it considers a bunch of outputs at the same time, and it uses toposort to traverse the graph, making sure each node is seen only once.
| 名称 |
最后提交
|
最后更新 |
|---|---|---|
| benchmark | 正在载入提交数据... | |
| bin | 正在载入提交数据... | |
| doc | 正在载入提交数据... | |
| theano | 正在载入提交数据... | |
| .hgignore | 正在载入提交数据... | |
| DESCRIPTION.txt | 正在载入提交数据... | |
| EMAIL.txt | 正在载入提交数据... | |
| HISTORY.txt | 正在载入提交数据... | |
| LICENSE.txt | 正在载入提交数据... | |
| MANIFEST.in | 正在载入提交数据... | |
| NEWS.txt | 正在载入提交数据... | |
| README.txt | 正在载入提交数据... | |
| distribute_setup.py | 正在载入提交数据... | |
| setup.cfg | 正在载入提交数据... | |
| setup.py | 正在载入提交数据... |