全文获取类型
收费全文 | 386篇 |
免费 | 20篇 |
国内免费 | 17篇 |
专业分类
化学 | 3篇 |
力学 | 8篇 |
综合类 | 3篇 |
数学 | 398篇 |
物理学 | 11篇 |
出版年
2023年 | 5篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 14篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 11篇 |
2016年 | 4篇 |
2015年 | 8篇 |
2014年 | 15篇 |
2013年 | 21篇 |
2012年 | 7篇 |
2011年 | 7篇 |
2010年 | 12篇 |
2009年 | 41篇 |
2008年 | 34篇 |
2007年 | 28篇 |
2006年 | 21篇 |
2005年 | 12篇 |
2004年 | 20篇 |
2003年 | 18篇 |
2002年 | 18篇 |
2001年 | 16篇 |
2000年 | 21篇 |
1999年 | 13篇 |
1998年 | 13篇 |
1997年 | 9篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有423条查询结果,搜索用时 406 毫秒
101.
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We then present a recursive construction which establishes the existence of 6-sparse systems for an infinite set of orders. Observations are also made concerning existing construction methods for perfect Steiner triple systems, and we give a further example of such a system. This has order 135,859 and is only the fourteenth known. Finally, we present a uniform Steiner triple system of order 180,907. 相似文献
102.
Darko Skorin-Kapov 《Annals of Operations Research》1995,57(1):233-249
A cost allocation problem arising from the Steiner Tree (ST) problem in networks is analyzed. This cost allocation problem is formulated as a cost cooperative game in characteristic function form, referred to as theST-game. The class ofST games generalizes the class of minimum cost spanning tree games which were used in the literature to analyze a variety of cost allocation problems. In general, the core of anST-game may be empty. We construct an efficient Core Heuristic to compute a good lower bound on the maximum fraction of the total cost that can be distributed among users while satisfying the core constraints. Based on the Core Heuristic, we also provide a sufficient condition for a givenST not to be optimal for the linear programming relaxation of an integer programming formulation of theST problem. The Core Heuristic was implemented and tested on 76 data sets from the literature (Wong's, Aneja's and Beasley's Steiner tree problems). Core points were found for 69 of these cases, and points close to the core were computed in the others. 相似文献
103.
In this article, we investigate a block sequence of a Steiner quadruple system which contains the blocks exactly once such that the collection of all blocks together with all unions of two consecutive blocks of the sequence forms an error correcting code with minimum distance four. In particular, we give two recursive constructions and obtain infinitely many such sequences by utilizing individual sequences as starters of the recursions. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 152–163, 2008 相似文献
104.
Alysson M. Costa Jean-François Cordeau Gilbert Laporte 《European Journal of Operational Research》2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed. 相似文献
105.
The paper gives the proof of the following fact: all simple, i.e., having no nodes of degree 2, trees that span the vertices of the regular n-dimensional simplex can be realized as nondegenerate minimal parametric networks. 相似文献
106.
A revised Yau's Curvature Difference Flow is considered to deform one convex curve to another one . It is proved that this flow exists globally on time interval and the evolving curve, preserving its convexity and bounded area A, converges to a fixed limiting curve (congruent to ) as time tends to infinity, where is the area bounded by the target curve . 相似文献
107.
108.
Amir Hossein Ghodrati 《组合设计杂志》2019,27(5):295-310
To every Steiner system with parameters on and blocks , we can assign its characteristic vector , which is a ‐vector whose entries are indexed by the ‐subsets of such that for each ‐subset of if and only if . In this paper, we show that the dimension of the vector space generated by all of the characteristic vectors of Steiner systems with parameters is , provided that and there is at least one such system. 相似文献
109.
110.
If the order of any product of two different translations of a finite Steiner quasigroup of size n>3 is odd, then the group G generated by the translations of the corresponding Steiner loop of order n+1 contains the alternating group of degree n+1. 相似文献