全文获取类型
收费全文 | 4948篇 |
免费 | 589篇 |
国内免费 | 355篇 |
专业分类
化学 | 634篇 |
晶体学 | 23篇 |
力学 | 475篇 |
综合类 | 90篇 |
数学 | 3604篇 |
物理学 | 1066篇 |
出版年
2024年 | 8篇 |
2023年 | 43篇 |
2022年 | 84篇 |
2021年 | 129篇 |
2020年 | 127篇 |
2019年 | 116篇 |
2018年 | 143篇 |
2017年 | 182篇 |
2016年 | 157篇 |
2015年 | 129篇 |
2014年 | 210篇 |
2013年 | 421篇 |
2012年 | 218篇 |
2011年 | 224篇 |
2010年 | 235篇 |
2009年 | 295篇 |
2008年 | 312篇 |
2007年 | 346篇 |
2006年 | 280篇 |
2005年 | 281篇 |
2004年 | 229篇 |
2003年 | 180篇 |
2002年 | 208篇 |
2001年 | 189篇 |
2000年 | 185篇 |
1999年 | 157篇 |
1998年 | 134篇 |
1997年 | 126篇 |
1996年 | 92篇 |
1995年 | 69篇 |
1994年 | 63篇 |
1993年 | 43篇 |
1992年 | 37篇 |
1991年 | 31篇 |
1990年 | 22篇 |
1989年 | 18篇 |
1988年 | 21篇 |
1987年 | 12篇 |
1986年 | 17篇 |
1985年 | 21篇 |
1984年 | 17篇 |
1983年 | 9篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 4篇 |
1971年 | 3篇 |
排序方式: 共有5892条查询结果,搜索用时 109 毫秒
81.
Most successful heuristics for solving 1||∑wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3) to O(n2). We show that this result also improves the complexity of the recently developed dynasearch heuristics. 相似文献
82.
In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem
is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We
present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to
be loaded according to their final destination, such that different portions of the ship are independently considered for
the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we
check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which
is based on local search techniques. The validation of the proposed approach is performed with some real life test cases.
This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence
on Integrated Logistics (CIELI) of the University of Genoa, Italy 相似文献
83.
This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications. 相似文献
84.
85.
COSEARCH: A Parallel Cooperative Metaheuristic 总被引:1,自引:0,他引:1
In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation
of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper,
we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic
assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of
the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary
behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and
a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations
via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks. 相似文献
86.
We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions. 相似文献
87.
何松年 《高等学校计算数学学报》2006,28(3):202-208
1引言我们考虑如下一维二阶椭圆边界值问题(-(β(x)p′)(x))′=f(x),x∈(a,b) p(a)=p(b)=0(1))其中β=β(x)是一恒正函数,且β∈H~1(a,b),f∈L~2(a,b).事实上,在此条件下,我们可保证p∈H~2(a,b)(见[1],[2]).(1)之弱形式为:求p∈H_0~1(a,b)使得a(p,q)=(f,q),(?)q∈H_0~1(a,b),(2)其中a(p,q)=(?)_a~bβp′q′dx,(f,g)=(?)_a~bfqdx.给定(a,b)的一个分割α=x_0<x_1<…<x_(n-1)<x_n=b,令h=(?)(x_i-x_(i-1)),(?)_i表示通常相应于节点x_i的形状函数,即(?)_i是连续的分段线性函数且满足(?)_i(x_k)=δ_(ik),这里δ_(ik)=(?)i,k=0,1,…,n.又记V_h~0=span{(?)_1,(?)_2,…,(?)_(n-1)),取V_h~0作为p的逼近空间,则求解(1)的标准有限元格式为:求ph∈V_h~0使得 相似文献
88.
In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis
of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets
of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness
of these algorithms are given. 相似文献
89.
90.
We use the topological tool of Nielsen fixed-point theory to study the controllability of perturbed linear control processes whose control space can be reduced to a finite-dimensional one. These methods produce a lower bound on the number of controls that achieve a given target. We concentrate particularly on the case where the perturbation has sublinear growth, and we exhibit examples of multiple controls of various types that are detected by the Nielsen theory method.This research was partly supported by the Research Grant Teoria del Controllo dei Sistemi Dinamici, Ministero della Pubblica Istruzione, Roma, Italy. 相似文献