全文获取类型
收费全文 | 2743篇 |
免费 | 63篇 |
国内免费 | 48篇 |
专业分类
管理学 | 568篇 |
民族学 | 4篇 |
人口学 | 7篇 |
丛书文集 | 64篇 |
理论方法论 | 23篇 |
综合类 | 931篇 |
社会学 | 46篇 |
统计学 | 1211篇 |
出版年
2024年 | 7篇 |
2023年 | 17篇 |
2022年 | 48篇 |
2021年 | 27篇 |
2020年 | 45篇 |
2019年 | 85篇 |
2018年 | 90篇 |
2017年 | 149篇 |
2016年 | 91篇 |
2015年 | 80篇 |
2014年 | 90篇 |
2013年 | 369篇 |
2012年 | 179篇 |
2011年 | 130篇 |
2010年 | 121篇 |
2009年 | 125篇 |
2008年 | 142篇 |
2007年 | 136篇 |
2006年 | 131篇 |
2005年 | 126篇 |
2004年 | 116篇 |
2003年 | 80篇 |
2002年 | 69篇 |
2001年 | 62篇 |
2000年 | 66篇 |
1999年 | 58篇 |
1998年 | 37篇 |
1997年 | 33篇 |
1996年 | 33篇 |
1995年 | 24篇 |
1994年 | 20篇 |
1993年 | 9篇 |
1992年 | 20篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 11篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1981年 | 2篇 |
排序方式: 共有2854条查询结果,搜索用时 10 毫秒
141.
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present,
is the best known approximation ratio achievable in polynomial time for SBR. A very closely related problem, called Breakpoint Graph Decomposition (BGD), calls for a largest collection of edge disjoint cycles in a suitably-defined graph. It has been shown that for almost all instances SBR is equivalent to BGD, in the sense that any solution of the latter corresponds to a solution of the former having the same value. In this paper, we show how to improve the approximation ratio achievable in polynomial time for BGD, from the previously known
to
for any > 0. Combined with the results in (Caprara, Journal of Combinatorial Optimization, vol. 3, pp. 149–182, 1999b), this yields the same approximation guarantee for n! – O((n – 5)!) out of the n! instances of SBR on permutations with n elements. Our result uses the best known approximation algorithms for Stable Set on graphs with maximum degree 4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio achieved by these approximation algorithms will yield an automatic improvement of our result. 相似文献
142.
Yoshiyuki Kusakari Daisuke Masubuchi Takao Nishizeki 《Journal of Combinatorial Optimization》2001,5(2):249-266
Let G = (V,E) be a plane graph with nonnegative edge weights, and let
be a family of k vertex sets
, called nets. Then a noncrossing Steiner forest for
in G is a set
of k trees
in G such that each tree
connects all vertices, called terminals, in net N
i, any two trees in
do not cross each other, and the sum of edge weights of all trees is minimum. In this paper we give an algorithm to find a noncrossing Steiner forest in a plane graph G for the case where all terminals in nets lie on any two of the face boundaries of G. The algorithm takes time
if G has n vertices and each net contains a bounded number of terminals. 相似文献
143.
数字签名技术的研究与探讨 总被引:2,自引:0,他引:2
李永新 《绍兴文理学院学报》2003,23(7):47-49
通过对对称加密体制、非对称加密体制以及Hash算法的分析,根据数字签名的要求,给出了一种具有防伪、防赖及保密的数字签名技术. 相似文献
144.
The problem of computing the strength and performing optimal reinforcement for an edge-weighted graph G(V, E, w) is well-studied. In this paper, we present fast (sequential linear time and parallel logarithmic time) on-line algorithms for optimally reinforcing the graph when the reinforcement material is available continuously on-line. These are the first on-line algorithms for this problem. We invest O(|V|3|E|log|V|) time (equivalent to (|V|) invocations of the fastest known algorithms for optimal reinforcement) in preprocessing the graph before the start of our algorithms. It is shown that the output of our on-line algorithms is as good as that of the off-line algorithms. Thus our algorithms are better than the fastest off-line algorithms in situations when a sequence of more than (|V|) reinforcement problems need to be solved. The key idea is to make use of ideas underlying the theory of Principal Partition of a Graph. Our ideas are easily generalized to the general setting of polymatroid functions. We also present a new efficient algorithm for computation of the Principal Sequence of a graph. 相似文献
145.
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem 总被引:10,自引:0,他引:10
This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the divide and pas conquer principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplex-based linear programming relaxation and a relaxed knapsack approach for the problem. 相似文献
146.
As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l
1 or l
norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l
1 and l
norms. It has been proved that the inverse maximum-weight perfect matching under l
norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l
1 norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l
1 and l
norms are solvable in polynomial time. 相似文献
147.
列举了影响高校学报进入国际著名检索系统的几个主要因素,并阐述了中文核心期刊对综合性普通高校学报的不利影响.提出了高校学报应结合本校教学科研优势,开办特色栏目,争取进入核心期刊;广辟稿源,公正审稿,评选优秀论文;缩短论文发表时滞,增设"研究快报";以读者为中心,扩大发行量,争取更大读者群等措施,扩大高校学报的影响力,提高知名度,争取进入国际著名检索系统. 相似文献
148.
A major step in effectively managing radio resources in a cellular network is to design an appropriate scheme for assigning cells to a location area (LA), serviced by a switch, and allocate resources for individual switches. However, this assignment is already proven in the literature to be an NP-hard problem [Merchant A, Sengupta B. Assignment of cells to switches in PCS networks. IEEE/ACM Transactions on Networking 3(5) (1995) 521–6] that requires efficient heuristic search techniques for obtaining real-time solutions. This work presents a state-space search technique, which is a variant of best first search heuristic technique. The algorithm called the block depth first search (BDFS), allocates cells to switches during switch level resource planning. Under various simulated performance criteria, we compare the performance of the proposed technique with other similar procedures in the literature. Our results indicate that the BDFS outperforms the meta-heuristic procedures in terms of both efficiency and quality of solutions. Hence, we conclude that our proposed technique can be effectively used for switch level planning leading to an efficient management of scarce radio resource in cellular networks. 相似文献
149.
Bernard Gendron Alain Hertz Patrick St-Louis 《Journal of Combinatorial Optimization》2007,13(2):163-178
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is
minimum. As shown by Gallai, Roy and Vitaver, this edge orienting problem is equivalent to finding the chromatic number of
a graph. We study various properties of edge orienting methods in the context of local search for graph coloring. We then
exploit these properties to derive four tabu search algorithms, each based on a different neighborhood. We compare these algorithms
numerically to determine which are the most promising and to give potential research directions. 相似文献
150.
动态共乘作为一种配合解决城市交通出行难题的新模式近年来引起了人们越来越多的关注,然而在较大范围内选择合适的乘客,以便获得最佳的综合服务效果却具有相当大的挑战性。本文正是针对这一问题,建立了以乘客效用最大化和司机总行程最短为目标函数,以满足司机与乘客的时间要求和司机参与约束为限制条件的多目标0-1规划共乘模型,用于帮助司机选择最合适的乘客。根据该模型的特点,构造了加入了分散搜索机制的新的和声搜索算法。在仿真实验时,针对司机和乘客效用的两种产生方式,在较大规模的路网环境下利用该算法分别对模型进行了求解,得到了Pareto最优解集。仿真结果不仅表明了模型的合理性和算法的可行性,而且还指出基于效用函数可以发现更多合适的潜在乘客。最后,通过与文献中其它算法的对比进一步展示了本文算法的有效性。 相似文献