全文获取类型
收费全文 | 1462篇 |
免费 | 140篇 |
国内免费 | 97篇 |
专业分类
化学 | 63篇 |
晶体学 | 1篇 |
力学 | 63篇 |
综合类 | 26篇 |
数学 | 1356篇 |
物理学 | 190篇 |
出版年
2024年 | 3篇 |
2023年 | 24篇 |
2022年 | 45篇 |
2021年 | 30篇 |
2020年 | 61篇 |
2019年 | 47篇 |
2018年 | 54篇 |
2017年 | 53篇 |
2016年 | 45篇 |
2015年 | 32篇 |
2014年 | 65篇 |
2013年 | 109篇 |
2012年 | 79篇 |
2011年 | 108篇 |
2010年 | 86篇 |
2009年 | 130篇 |
2008年 | 120篇 |
2007年 | 71篇 |
2006年 | 101篇 |
2005年 | 70篇 |
2004年 | 62篇 |
2003年 | 45篇 |
2002年 | 45篇 |
2001年 | 37篇 |
2000年 | 33篇 |
1999年 | 29篇 |
1998年 | 30篇 |
1997年 | 22篇 |
1996年 | 12篇 |
1995年 | 13篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 2篇 |
排序方式: 共有1699条查询结果,搜索用时 15 毫秒
111.
112.
An ant-based algorithm for coloring graphs 总被引:1,自引:0,他引:1
This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors just a portion of the graph using only local information. These individual coloring actions by the ants form a coloring of the graph. Even with the lack of pheromone laying capacity by the ants, the algorithm performed well on a set of 119 benchmark graphs. Furthermore, the algorithm produced very consistent results, having very small standard deviations over 50 runs of each graph tested. 相似文献
113.
灰关联模式评估模型在大学生体质健康水平综合评价中的应用 总被引:1,自引:0,他引:1
针对在大学生体质健康水平评价过程中指标权重确定、评价标准区分度等问题,讨论了单层和多层灰关联模式评估模型,并在权重的确定上采用熵权系数,以此为基础构建大学生体质健康水平综合评价体系,客观反映了大学生体质健康水平及个体间的差异. 相似文献
114.
Quantum annealing extends simulated annealing by introducing artificial quantum fluctuations. The path-integral Monte Carlo version chosen is population-based and designed to be implemented on a classical computer. Its first application to the graph coloring problem is presented in this paper. It is shown by experiments that quantum annealing can outperform classical thermal simulated annealing for this particular problem. Moreover, quantum annealing proved competitive when compared with the best algorithms on most of the difficult instances from the DIMACS benchmarks. The quantum annealing algorithm has even found that the well-known benchmark graph dsjc1000.9 has a chromatic number of at most 222. This is an improvement on its best upper-bound from a large body of literature. 相似文献
115.
A discussion is proposed on the paper “Evaluación numérica del efecto del espesor de la placa de contacto en la acción de palanca en conexión de acero tipo T” by L.M. Bezerra, C.S. de Freitas, W.T. Matias and J.E. Carmona. The topics to be discussed are the definition of the T-stub model, the bibliographic references used in the work and the finite element analysis assumptions adopted in the modeling of the components. 相似文献
116.
Carl Johan Casselgren 《Random Structures and Algorithms》2014,44(3):317-327
Let G = G(n) be a graph on n vertices with maximum degree bounded by some absolute constant Δ. Assign to each vertex v of G a list L(v) of colors by choosing each list uniformly at random from all k‐subsets of a color set of size . Such a list assignment is called a random ‐list assignment. In this paper, we are interested in determining the asymptotic probability (as ) of the existence of a proper coloring ? of G, such that for every vertex v of G. We show, for all fixed k and growing n, that if , then the probability that G has such a proper coloring tends to 1 as . A similar result for complete graphs is also obtained: if and L is a random ‐list assignment for the complete graph Kn on n vertices, then the probability that Kn has a proper coloring with colors from the random lists tends to 1 as .Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 317‐327, 2014 相似文献
117.
CHEN XIANG-EN HE WEN-YU LI ZE-PENG YAO BING 《数学研究通讯:英文版》2014,(3):222-236
Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C(u)=C(v) for any two different vertices u and v of V (G), then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G), and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper. 相似文献
118.
《Journal of computational science》2014,5(1):1-11
Partial differential equations can be discretized using a regular Cartesian grid and a stencil-based method to approximate the partial derivatives. The computational effort for determining the associated Jacobian matrix can be reduced. This reduction can be modeled as a (grid) coloring problem. Currently, this problem is solved by using a heuristic approach for general graphs or by developing a formula for every single stencil. We introduce a sub-exponential algorithm using the Lipton–Tarjan separator in a divide-and-conquer approach to compute an optimal coloring. The practical relevance of the algorithm is evaluated when compared with an exponential algorithm and a greedy heuristic. 相似文献
119.
应用构造染色函数法研究了冠图C_m·C_n、C_m·C_n的邻点可区别V-全染色.通过对P_m·C_n的邻点可区别V-全染色的研究巧妙给出了C_m·C_n邻点可区别V-全染色,并得到了这些图的邻点可区别V-全色数,从而验证了图的邻点可区别V-全染色猜想. 相似文献
120.
Wensong Lin 《Discrete Mathematics》2008,308(16):3565-3573
The generalized Mycielskians of graphs (also known as cones over graphs) are the natural generalization of the Mycielskians of graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer p?0, one can transform G into a new graph μp(G), the p-Mycielskian of G. In this paper, we study the kth chromatic numbers χk of Mycielskians and generalized Mycielskians of graphs. We show that χk(G)+1?χk(μ(G))?χk(G)+k, where both upper and lower bounds are attainable. We then investigate the kth chromatic number of Mycielskians of cycles and determine the kth chromatic number of p-Mycielskian of a complete graph Kn for any integers k?1, p?0 and n?2. Finally, we prove that if a graph G is a/b-colorable then the p-Mycielskian of G, μp(G), is (at+bp+1)/bt-colorable, where . And thus obtain graphs G with m(G) grows exponentially with the order of G, where m(G) is the minimal denominator of a a/b-coloring of G with χf(G)=a/b. 相似文献