全文获取类型
收费全文 | 3296篇 |
免费 | 257篇 |
国内免费 | 3篇 |
学科分类
工业技术 | 3556篇 |
出版年
2023年 | 53篇 |
2022年 | 42篇 |
2021年 | 117篇 |
2020年 | 110篇 |
2019年 | 112篇 |
2018年 | 193篇 |
2017年 | 192篇 |
2016年 | 216篇 |
2015年 | 153篇 |
2014年 | 188篇 |
2013年 | 389篇 |
2012年 | 206篇 |
2011年 | 215篇 |
2010年 | 196篇 |
2009年 | 168篇 |
2008年 | 110篇 |
2007年 | 77篇 |
2006年 | 45篇 |
2005年 | 23篇 |
2004年 | 32篇 |
2003年 | 33篇 |
2002年 | 31篇 |
2001年 | 30篇 |
2000年 | 28篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 19篇 |
1996年 | 25篇 |
1995年 | 20篇 |
1994年 | 28篇 |
1993年 | 24篇 |
1992年 | 23篇 |
1991年 | 18篇 |
1989年 | 12篇 |
1988年 | 13篇 |
1987年 | 16篇 |
1986年 | 15篇 |
1985年 | 26篇 |
1984年 | 30篇 |
1983年 | 25篇 |
1982年 | 24篇 |
1981年 | 23篇 |
1980年 | 19篇 |
1979年 | 17篇 |
1978年 | 13篇 |
1977年 | 19篇 |
1976年 | 18篇 |
1975年 | 18篇 |
1974年 | 17篇 |
1973年 | 18篇 |
排序方式: 共有3556条查询结果,搜索用时 15 毫秒
41.
We present a simple randomized algorithm which solves linear programs withn constraints andd variables in expected $$\min \{ O(d^2 2^d n),e^{2\sqrt {dIn({n \mathord{\left/ {\vphantom {n {\sqrt d }}} \right. \kern-\nulldelimiterspace} {\sqrt d }})} + O(\sqrt d + Inn)} \}$$ time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise, the algorithm computes the lexicographically smallest nonnegative point satisfyingn given linear inequalities ind variables. The expectation is over the internal randomizations performed by the algorithm, and holds for any input. In conjunction with Clarkson's linear programming algorithm, this gives an expected bound of $$O(d^2 n + e^{O(\sqrt {dInd} )} ).$$ The algorithm is presented in an abstract framework, which facilitates its application to several other related problems like computing the smallest enclosing ball (smallest volume enclosing ellipsoid) ofn points ind-space, computing the distance of twon-vertex (orn-facet) polytopes ind-space, and others. The subexponential running time can also be established for some of these problems (this relies on some recent results due to Gärtner). 相似文献
42.
43.
44.
Filip Goldefus Tomáš Masopust Alexander Meduna 《Theoretical computer science》2010,411(40-42):3661-3667
A left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set of nonterminal symbols is attached to each context-free production. Such a production can rewrite a nonterminal provided that no symbol from the attached set occurs to the left of the rewritten nonterminal in the current sentential form. The present paper discusses cooperating distributed grammar systems with left-forbidding grammars as components and gives some new characterizations of language families of the Chomsky hierarchy. In addition, it also proves that twelve nonterminals are enough for cooperating distributed grammar systems working in the terminal derivation mode with two left-forbidding components (including erasing productions) to characterize the family of recursively enumerable languages. 相似文献
45.
The paper deals with a numerical analysis of the incomplete interior penalty Galerkin (IIPG) method applied to one dimensional
Poisson problem. Based on a particular choice of the interior penalty parameter σ (order of O(h
−1)), we derive the optimal error estimate in the L
2-norm for odd degrees of polynomial approximation for locally quasi-uniform meshes. Moreover, we show that only the mentioned
choice of the penalty parameter leads to optimal orders of convergence. Finally, presented numerical experiments verify the
theoretical results. 相似文献
46.
47.
48.
We present a theoretical model for self-assembling DNA tiles with flexible branches. We encode an instance of a “problem” as a pot of such tiles for which a “solution” is an assembled complete complex without any free sticky ends. Using the number of tiles in an assembled complex as a measure of complexity we show how NTIME classes (such as NP and NEXP) can be represented with corresponding classes of the model. 相似文献
49.
50.
Gjorgji Madjarov Dejan Gjorgjevikj Ivica Dimitrovski Sašo Džeroski 《Journal of Intelligent Information Systems》2016,47(1):57-90
Instead of traditional (multi-class) learning approaches that assume label independency, multi-label learning approaches must deal with the existing label dependencies and relations. Many approaches try to model these dependencies in the process of learning and integrate them in the final predictive model, without making a clear difference between the learning process and the process of modeling the label dependencies. Also, the label relations incorporated in the learned model are not directly visible and can not be (re)used in conjunction with other learning approaches. In this paper, we investigate the use of label hierarchies in multi-label classification, constructed in a data-driven manner. We first consider flat label sets and construct label hierarchies from the label sets that appear in the annotations of the training data by using a hierarchical clustering approach. The obtained hierarchies are then used in conjunction with hierarchical multi-label classification (HMC) approaches (two local model approaches for HMC, based on SVMs and PCTs, and two global model approaches, based on PCTs for HMC and ensembles thereof). The experimental results reveal that the use of the data-derived label hierarchy can significantly improve the performance of single predictive models in multi-label classification as compared to the use of a flat label set, while this is not preserved for the ensemble models. 相似文献