全文获取类型
收费全文 | 157篇 |
免费 | 3篇 |
国内免费 | 6篇 |
专业分类
综合类 | 2篇 |
数学 | 158篇 |
物理学 | 6篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 5篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 1篇 |
2015年 | 1篇 |
2014年 | 4篇 |
2013年 | 10篇 |
2012年 | 2篇 |
2011年 | 7篇 |
2010年 | 11篇 |
2009年 | 13篇 |
2008年 | 17篇 |
2007年 | 6篇 |
2006年 | 11篇 |
2005年 | 2篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 2篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有166条查询结果,搜索用时 31 毫秒
71.
72.
73.
We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually a tree. Contrary to other directed forests of the literature, no Markovian process can be introduced to study the paths in our DSF. Our proof is based on a comparison argument between surface and perimeter from percolation theory. We then show that this result still holds when the points of N belonging to an auxiliary Boolean model are removed. Using these results, we prove that there is no bi‐infinite paths in the DSF. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 相似文献
74.
75.
We consider the problem of cost allocation among users of a minimum cost spanning tree network. It is formulated as a cooperative game in characteristic function form, referred to as a minimum cost spanning tree (m.c.s.t.) game. We show that the core of a m.c.s.t. game is never empty. In fact, a point in the core can be read directly from any minimum cost spanning tree graph associated with the problem. For m.c.s.t. games with efficient coalition structures we define and construct m.c.s.t. games on the components of the structure. We show that the core and the nucleolus of the original game are the cartesian products of the cores and the nucleoli, respectively, of the induced games on the components of the efficient coalition structure.This paper is a revision of [4]. 相似文献
76.
In this paper, we focus on the directed minimum degree spanning tree problem and the minimum time broadcast problem. Firstly, we propose a polynomial time algorithm for the minimum degree spanning tree problem in directed acyclic graphs. The algorithm starts with an arbitrary spanning tree, and iteratively reduces the number of vertices of maximum degree. We can prove that the algorithm must reduce a vertex of the maximum degree for each phase, and finally result in an optimal tree. The algorithm terminates in O(mnlogn) time, where m and n are the numbers of edges and vertices of the graph, respectively. Moreover, we apply the new algorithm to the minimum time broadcast problem. Two consequences for directed acyclic graphs are: (1) the problem under the vertex-disjoint paths mode can be approximated within a factor of of the optimum in O(mnlogn)-time; (2) the problem under the edge-disjoint paths mode can be approximated within a factor of O(Δ*/logΔ*) of the optimum in O(mnlogn)-time, where Δ* is the minimum k such that there is a spanning tree of the graph with maximum degree k. 相似文献
77.
R. S. Laugesen 《Journal of Fourier Analysis and Applications》2008,14(2):235-266
The affine synthesis operator
is shown to map the coefficient space ℓ
p
(ℤ+×ℤ
d
) surjectively onto L
p
(ℝ
d
), for p∈(0,1]. Here ψ
j,k
(x)=|det a
j
|1/p
ψ(a
j
x−k) for dilation matrices a
j
that expand, and the synthesizer ψ∈L
p
(ℝ
d
) need satisfy only mild restrictions, for example, ψ∈L
1(ℝ
d
) with nonzero integral or else with periodization that is real-valued, nontrivial and bounded below.
An affine atomic decomposition of L
p
follows immediately:
Tools include an analysis operator that is nonlinear on L
p
.
Laugesen’s travel was supported by the NSF under Award DMS–0140481. 相似文献
78.
79.
80.
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform a study on the enumeration of spanning trees in a specific small-world network with an exponential distribution of vertex degrees, which is called a Farey graph since it is associated with the famous Farey sequence. According to the particular network structure, we provide some recursive relations governing the Laplacian characteristic polynomials of a Farey graph and its subgraphs. Then, making use of these relations obtained here, we derive the exact number of spanning trees in the Farey graph, as well as an approximate numerical solution for the asymptotic growth constant characterizing the network. Finally, we compare our results with those of different types of networks previously investigated. 相似文献