理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 perfect相关记录30条 . 查询时间(0.062 秒)
Similar to the role of Markov decision processes in reinforcement learning, Markov games (also known as stochastic games) form the basis for the study of multi-agent reinforcement learning and sequenc...
Matchings are fundamental objects in the study of graph theory. Unlike in graphs, finding maximum matchings in general hypergraphs is NP-hard -- its decision problem is actually one of the Karp’s 21 N...
Passion makes perfect     Passion  makes perfect       2016/7/15
Po-Shen Loh loves math. He doesn't say that outright, but he doesn't have to, either.His first brush with the Math Olympiads was in 1994, when he was a sixth grader. That year, the International Math ...
Frames which are tight might be considered optimally conditioned in the sense of their numerical stability.This leads to the question of perfect preconditioning of frames,i.e., modification of a given...
An interesting example of a compact Hausdorff space that is often presented in beginning courses in topology is the unit square [0, 1]× [0, 1] with the lexicographic order topology. The closed subspac...
The Mathematics of Perfect Shuffles     Mathematics  upset       2015/7/14
There are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in half and interlace perfectly. The out shuffle 0 leaves the original top card on top. The in shuffle I leave...
Let p be a prime, P a finite p-group and F a Frobenius P-category. The question on the existence of a suitable category L^sc extending the full subcategory of F over the set of F-selfcentralizing subg...
A conjecture predicting an injective and surjective mapping $X = \displaystyle\frac{\sigma(p^k)}{p^k}, Y = \displaystyle\frac{\sigma(m^2)}{m^2}$ between OPNs $N = {p^k}{m^2}$ (with Euler factor $p^k$)...
Abstract: The existence question for tiling of the $n$-dimensional Euclidian space by crosses is well known. A few existence and nonexistence results are known in the literature. Of special interest a...
Abstract: We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing...
Abstract: This purpose of this paper is to show how Rees algebras can be applied in the study of singularities embedded in smooth schemes over perfect fields. In particular, we will study situations i...
Abstract: This paper deals with the problem of perfect sampling from a Gibbs measure with infinite range interactions. We present some sufficient conditions for the extinction of processes which are l...
Perfect sampling is a technique that uses coupling arguments to provide a sample from the stationary distribution of a Markov chain in a nite time without ever computing the distribution.
We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings. This confirms an old conjecture of Lov´asz and Plummer.
It is well-known that the Julia set J(f) of a rational map f : C → C is uniformly perfect; that is, every ring domain which separates J(f) has bounded modulus,with the bound depending only on f. In th...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...