全文获取类型
收费全文 | 1132篇 |
免费 | 18篇 |
国内免费 | 27篇 |
专业分类
化学 | 215篇 |
力学 | 8篇 |
综合类 | 3篇 |
数学 | 860篇 |
物理学 | 91篇 |
出版年
2023年 | 20篇 |
2022年 | 18篇 |
2021年 | 14篇 |
2020年 | 21篇 |
2019年 | 14篇 |
2018年 | 35篇 |
2017年 | 17篇 |
2016年 | 9篇 |
2015年 | 3篇 |
2014年 | 47篇 |
2013年 | 90篇 |
2012年 | 43篇 |
2011年 | 66篇 |
2010年 | 59篇 |
2009年 | 108篇 |
2008年 | 111篇 |
2007年 | 84篇 |
2006年 | 84篇 |
2005年 | 46篇 |
2004年 | 41篇 |
2003年 | 17篇 |
2002年 | 14篇 |
2001年 | 21篇 |
2000年 | 9篇 |
1999年 | 33篇 |
1998年 | 37篇 |
1997年 | 27篇 |
1996年 | 31篇 |
1995年 | 13篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 6篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有1177条查询结果,搜索用时 46 毫秒
51.
52.
Daniel Berend 《Discrete Mathematics》2008,308(20):4670-4695
We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order. 相似文献
53.
We give a linear-time algorithm to find a feasible flow in a strongly connected network with fixed supplies and demands, each summing to a common value that is at most the minimum arc capacity. This algorithm speeds up the Goldberg-Rao maximum flow method by a constant factor. 相似文献
54.
Manuel Maia 《Discrete Mathematics》2008,308(23):5407-5427
We introduce two new binary operations on combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series in the context of species. It allows us to introduce the notion of multiplicative species, a lifting to the combinatorial level of the classical notion of multiplicative arithmetic function. Interesting combinatorial constructions are introduced; cloned assemblies of structures, hyper-cloned trees, enriched rectangles, etc. Recent research of Cameron, Gewurz and Merola, about the product action in the context of oligomorphic groups, motivated the introduction of the modified arithmetic product. By using the modified arithmetic product we obtain new enumerative results. We also generalize and simplify some results of Canfield, and Pittel, related to the enumerations of tuples of partitions with the restrictions met. 相似文献
55.
We consider the vertex coloring problem, which can be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each vertex receives at least one label and the endpoints of every edge are assigned different labels. In this work, the 0-1 integer programming formulation based on representative vertices is revisited to remove symmetry. The previous polyhedral study related to the original formulation is adapted and generalized. New versions of facets derived from substructures of G are presented, including cliques, odd holes and anti-holes and wheels. In addition, a new class of facets is derived from independent sets of G. Finally, a comparison with the independent sets formulation is provided. 相似文献
56.
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90° so long as they are placed with edges parallel to the pallet’s edges. The set of all PLP instances with an area ratio (pallet area divided by box area) less than 101 boxes can be represented by 3,080,730 equivalent classes. Our G5-heuristic finds optimal solutions to 3,073,724 of these 3,080,730 classes and in the remaining 7006 classes only differs from the best known bound by one box. We develop three other heuristics that solve another 54 instances. Finally, we solve the 6952 remaining classes with our exact HVZ algorithm. Only a subset of these classes has been solved previously. 相似文献
57.
Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks 总被引:1,自引:0,他引:1
In real road networks, the presence of no-left, no-right or no U-turn signs, restricts the movement of vehicles at intersections.
These turn prohibitions must be considered when calculating the shortest path between a starting and an ending point in a
road network. We propose an extension of Dijkstra’s algorithm to solve the shortest path problem with turn prohibitions. The
method uses arc labeling and a network structure with low memory requirements. We compare the proposed method with the dual
graph approach in a set of randomly generated networks and Bogotá’s large-scale road network. Our computational experiments
show that the performance of the proposed method is better than that of the dual graph approach, both in terms of computing
time and memory requirements. We co-developed a Web-based decision support system for computing shortest paths with turn prohibitions
that uses the proposed method as the core engine. 相似文献
58.
Meritxell Vinyals Andrea Giovannucci Jesús Cerquides Pedro Meseguer Juan A. Rodriguez-Aguilar 《Journal of Algorithms in Cognition, Informatics and Logic》2008,63(1-3):130
Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application of MMUCAs by: (1) providing an algorithm to generate artificial data that is representative of the sort of scenarios a winner determination algorithm is likely to encounter; and (2) subsequently assessing the performance of an Integer Programming implementation of MMUCA in CPLEX. 相似文献
59.
The overlay of 2≤m≤d minimization diagrams of n surfaces in ℝ
d
is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in ℝ
d+m−1. This elementary observation leads to a new bound on the complexity of the overlay of minimization diagrams of collections
of d-variate semi-algebraic surfaces, a tight bound on the complexity of the overlay of minimization diagrams of collections of
hyperplanes, and faster algorithms for constructing such overlays. Further algorithmic implications are discussed.
Work by V. Koltun was supported by NSF CAREER award CCF-0641402.
Work by M. Sharir was supported by NSF Grants CCR-00-98246 and CCF-05-14079, by a grant from the Israeli Academy of Sciences
for a Center of Excellence in Geometric Computing at Tel Aviv University, and by the Hermann Minkowski Minerva Center for
Geometry at Tel Aviv University. 相似文献
60.
Stochastic global search algorithms such as genetic algorithms are used to attack difficult combinatorial optimization problems.
However, genetic algorithms suffer from the lack of a convergence proof. This means that it is difficult to establish reliable
algorithm braking criteria without extensive a priori knowledge of the solution space. The hybrid genetic algorithm presented here combines a genetic algorithm with simulated
annealing in order to overcome the algorithm convergence problem. The genetic algorithm runs inside the simulated annealing
algorithm and provides convergence via a Boltzmann cooling process. The hybrid algorithm was used successfully to solve a
classical 30-city traveling salesman problem; it consistently outperformed both a conventional genetic algorithm and a conventional
simulated annealing algorithm.
This work was supported by the University of Colorado at Colorado Springs. 相似文献