搜索结果: 1-7 共查到“数学 Better”相关记录7条 . 查询时间(0.088 秒)
Toric Deligne-Mumford stacks and the better behaved version of the GKZ hypergeometric system
Toric Deligne-Mumford stacks GKZ hypergeometric system Algebraic Geometry
2012/5/9
We generalize the combinatorial description of the orbifold (Chen--Ruan) cohomology and of the Grothendieck ring of a Deligne--Mumford toric stack and its associated stacky fan in a lattice $N$ in the...
Reconstructing directed networks for better synchronization
synchronization Reconstructing directed networks strategies
2011/7/7
In this paper, we studied the strategies to enhance synchronization on directed networks by manipulating a fixed number of links. We proposed a centrality-based reconstructing (CBR) method, where the ...
Towards a Better Understanding of Large Scale Network Models
Better Understanding Large Scale Network Models
2011/3/4
Connectivity and capacity are two fundamental properties of wireless multi-hop networks. The scalability of these properties has been a primary concern for which asymptotic analysis is a useful tool.
m solutions good, m-1 solutions better
computability optimization solving systems of equations
2010/9/10
One of the main objectives of theoretical research in computational complexity and feasibility is to explain experimentally observed difference in complexity. Empirical evidence shows that the more so...
In this paper, we present a new semi-discrete difference scheme for the KdV equation, which possesses the first four nearconserved quatities. The scheme is better than the past one given in [4], becau...
ARE BILINEAR QUADRILATERALS BETTER THAN LINEAR TRIANGLES
linear approximation bilinear quadrilaterals linear triangles finite element computations
2007/3/29
This paper compares the theoretical effectiveness of bilinear approximation over quadrilaterals with linear approximation over triangles. Anisotropic mesh transformation is used to generate asymptotic...
Better Approximations for the Minimum Common Integer Partition Problem
the Minimum Common Integer Partition Problem
2012/11/29
In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . ,Xk of positive integers, and the goal is to find an integer multiset T of minimal size for wh...