全文获取类型
收费全文 | 475篇 |
免费 | 21篇 |
国内免费 | 18篇 |
学科分类
工业技术 | 514篇 |
出版年
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 18篇 |
2013年 | 10篇 |
2012年 | 33篇 |
2011年 | 19篇 |
2010年 | 17篇 |
2009年 | 15篇 |
2008年 | 28篇 |
2007年 | 39篇 |
2006年 | 42篇 |
2005年 | 24篇 |
2004年 | 36篇 |
2003年 | 23篇 |
2002年 | 20篇 |
2001年 | 15篇 |
2000年 | 16篇 |
1999年 | 14篇 |
1998年 | 19篇 |
1997年 | 4篇 |
1996年 | 14篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 5篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有514条查询结果,搜索用时 17 毫秒
11.
文章对空气质量自动监测系统的异构性问题进行了分析与研究,提出了"抽象设备、映射数据、虚拟协议"的解决方案,将物理设备屏蔽在驱动一级,将抽象设备屏蔽在转换程序一级,将数据按空气质量因子分类型打包传送到组态王对应的寄存器组,实现了不同数据接口、不同数据类型以及不同传送协议下的企业信息自动化。 相似文献
12.
基于完备抽象解释的模型检验CTL公式研究 总被引:1,自引:0,他引:1
在模型检验中,抽象是解决状态空间爆炸问题的重要方法之一.给定具体Kripke结构和时序描述语言CTL,基于抽象解释框架以及完备抽象解释和性质强保留之间的关系,抽象模型最小精化使得CTL性质强保留,可转换为抽象解释中抽象域的最小完备精化,并且总是存在抽象域的最小完备精化.根据状态标签函数确定初始抽象域,然后通过不动点求解,获得对CTL标准算子完备的最小抽象域,并依据此抽象域求得CTL性质强保留的最优抽象状态划分,最后构造出CTL性质强保留且最优的抽象状态转换系统.并指出了抽象域对CTL标准算子是完备的当且仅当抽象域对补集和标准前向转换是完备的. 相似文献
13.
Paul E. Dunne 《Artificial Intelligence》2009,173(18):1559-1591
We analyse the computational complexity of the recently proposed ideal semantics within both abstract argumentation frameworks (afs) and assumption-based argumentation frameworks (abfs). It is shown that while typically less tractable than credulous admissibi-lity semantics, the natural decision problems arising with this extension-based model can, perhaps surprisingly, be decided more efficiently than sceptical preferred semantics. In particular the task of finding the unique ideal extension is easier than that of deciding if a given argument is accepted under the sceptical semantics. We provide efficient algorithmic approaches for the class of bipartite argumentation frameworks and, finally, present a number of technical results which offer strong indications that typical problems in ideal argumentation are complete for the class of languages decidable by polynomial time algorithms allowed to make non-adaptive queries to a C oracle, where C is an upper bound on the computational complexity of deciding credulous acceptance: C=np for afs and logic programming (lp) instantiations of abfs; for abfs modelling default theories. 相似文献
14.
Generating sequences of actions–plans–for robots using Automated Planning in stochastic and dynamic environments has been shown to be a difficult task with high computational complexity. These plans are composed of actions whose execution might fail due to different reasons. In many cases, if the execution of an action fails, it prevents the execution of some (or all) of the remainder actions in the plan. Therefore, in most real-world scenarios computing a complete and sound (valid) plan at each (re-)planning step is not worth the computational resources and time required to generate the plan. This is specially true given the high probability of plan execution failure. Besides, in many real-world environments, plans must be generated fast, both at the start of the execution and after every execution failure. In this paper, we present Variable Resolution Planning which uses Automated Planning to quickly compute a reasonable (not necessarily sound) plan. Our approach computes an abstract representation–removing some information from the planning task–which is used once a search depth of steps has been reached. Thus, our approach generates a plan where the first actions are applicable if the domain is stationary and deterministic, while the rest of the plan might not be necessarily applicable. The advantages of this approach are that it: is faster than regular full-fledged planning (both in the probabilistic or deterministic settings); does not spend much time on the far future actions that probably will not be executed, since in most cases it will need to replan before executing the end of the plan; and takes into account some information of the far future, as an improvement over pure reactive systems. We present experimental results on different robotics domains that simulate tasks on stochastic environments. 相似文献
15.
16.
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithms and parsing algorithms. 相似文献
17.
18.
19.
Alessandra Di Pierro Pascal Sotin Herbert Wiklicky 《Electronic Notes in Theoretical Computer Science》2008,220(3):23
Within the context of a quantitative generalisation of the well established framework of Abstract Interpretation – i.e. Probabilistic Abstract Interpretation – we investigate a quantitative notion of precision which allows us to compare analyses on the basis of their expected exactness for a given program. We illustrate this approach by considering various types of numerical abstractions of the values of variables for independent analysis as well as weakly and fully relational analysis. We utilise for this a linear operator semantics of a simple imperative programming language. In this setting, fully relational dependencies are realised via the tensor product. Independent analyses and weakly relational analyses are realised as abstractions of the fully relational analysis. 相似文献
20.
We propose a semantics for the -quantifier of Miller and Tiu. First we consider the case for classical first-order logic. In this case, the interpretation is close to standard Tarski-semantics and completeness can be shown using a standard argument. Then we put our semantics into a broader context by giving a general interpretation of in categories with binding structure. Since categories with binding structure also encompass nominal logic, we thus show that both -logic and nominal logic can be modelled using the same definition of binding. As a special case of the general semantics in categories with binding structure, we recover Gabbay & Cheney's translation of FOλ into nominal logic. 相似文献