全文获取类型
收费全文 | 140篇 |
免费 | 5篇 |
专业分类
145篇 |
出版年
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 9篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 4篇 |
2014年 | 4篇 |
2013年 | 12篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 6篇 |
2007年 | 12篇 |
2006年 | 6篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 4篇 |
1972年 | 2篇 |
1971年 | 1篇 |
排序方式: 共有145条查询结果,搜索用时 0 毫秒
141.
Theoretical Medicine and Bioethics - Two dogmas of liberalism in the therapeutic setting are challenged: (1) that patients have a ready-made ability to act autonomously; and (2) that... 相似文献
142.
143.
Kalevi Kull and colleagues recently proposed eight theses as a conceptual basis for the field of biosemiotics. We use these theses as a framework for discussing important current areas of debate in biosemiotics with particular reference to the articles collected in this issue of Zygon. 相似文献
144.
145.
The computational power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections can allow a significant fraction of the knowledge of the system to be applied to an instance of a problem in a very short time. One kind of computation for which massively parallel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found. Second, there must be some way of choosing internal representations which allow the preexisting hardware connections to be used efficiently for encoding the constraints in the domain being searched. We describe a general parallel search method, based on statistical mechanics, and we show how it leads to a general learning rule for modifying the connection strengths so as to incorporate knowledge about a task domain in an efficient way. We describe some simple examples in which the learning algorithm creates internal representations that are demonstrably the most efficient way of using the preexisting connectivity structure. 相似文献