全文获取类型
收费全文 | 214篇 |
免费 | 51篇 |
国内免费 | 13篇 |
专业分类
化学 | 1篇 |
力学 | 7篇 |
综合类 | 2篇 |
数学 | 241篇 |
物理学 | 27篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 6篇 |
2021年 | 10篇 |
2020年 | 18篇 |
2019年 | 14篇 |
2018年 | 21篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 9篇 |
2013年 | 10篇 |
2012年 | 8篇 |
2011年 | 12篇 |
2010年 | 13篇 |
2009年 | 16篇 |
2008年 | 11篇 |
2007年 | 10篇 |
2006年 | 14篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1990年 | 3篇 |
1985年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有278条查询结果,搜索用时 15 毫秒
1.
2.
This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches. 相似文献
3.
Csilla Bujtás 《Discrete Applied Mathematics》2007,155(11):1395-1407
For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’ such that every C∈C meets some class in more than one vertex, and every D∈D has a nonempty intersection with at least two classes. A vertex-orderx1,x2,…,xn on X (n=|X|) is uniquely colorable if the subhypergraph induced by {xj:1?j?i} has precisely one coloring, for each i (1?i?n). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique. 相似文献
4.
A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k‐uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
5.
主要讨论了不含k-C-圈的n阶r-一致超图,对不同的k,分别得出了它的极大边数的一个下界,并且得出在有些情况下它的下界是最大的.另外,我们得到了Krn含k-C-圈的一个充分必要条件. 相似文献
6.
The difficulty suffered in optimization-based algorithms for the solution of nonlinear equations lies in that the traditional
methods for solving the optimization problem have been mainly concerned with finding a stationary point or a local minimizer
of the underlying optimization problem, which is not necessarily a solution of the equations. One method to overcome this
difficulty is the Lagrangian globalization (LG for simplicity) method. This paper extends the LG method to nonsmooth equations
with bound constraints. The absolute system of equations is introduced. A so-called Projected Generalized-Gradient Direction (PGGD) is constructed and proved to be a descent direction of the reformulated nonsmooth optimization problem. This projected
approach keeps the feasibility of the iterates. The convergence of the new algorithm is established by specializing the PGGD.
Numerical tests are given.
This author's work was done when she was visiting The Hong Kong Polytechnic University.
His work is also supported by the Research Grant Council of Hong Kong. 相似文献
7.
《Discrete Mathematics》2022,345(6):112832
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance. 相似文献
8.
9.
In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. 相似文献
10.
《Optimization》2012,61(3):413-427
The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB. 相似文献