咨询与建议

限定检索结果

文献类型

  • 15 篇 期刊文献
  • 4 篇 会议

馆藏范围

  • 19 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 14 篇 理学
    • 11 篇 数学
    • 5 篇 物理学
    • 3 篇 统计学(可授理学、...
    • 1 篇 大气科学
    • 1 篇 海洋科学
    • 1 篇 地球物理学
  • 7 篇 工学
    • 7 篇 计算机科学与技术...
    • 2 篇 电气工程
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 19 篇 asymptotically o...
  • 3 篇 wiener process
  • 3 篇 metric propertie...
  • 3 篇 nonhomogeneous p...
  • 3 篇 slichter mode
  • 3 篇 irreducible cove...
  • 2 篇 maximal conjunct...
  • 2 篇 irredundant cove...
  • 2 篇 complexity of en...
  • 2 篇 adaptive step-si...
  • 2 篇 np-hard problem
  • 2 篇 dualization prob...
  • 2 篇 metric propertie...
  • 2 篇 minimal strong e...
  • 2 篇 random inputs
  • 2 篇 minimal error
  • 2 篇 sdes with jumps
  • 2 篇 normed space
  • 1 篇 uniform distribu...
  • 1 篇 countably dimens...

机构

  • 3 篇 russian acad sci...
  • 2 篇 agh univ sci & t...
  • 2 篇 sobolev inst mat...
  • 2 篇 novosibirsk stat...
  • 2 篇 moscow mv lomono...
  • 1 篇 agh univ sci & t...
  • 1 篇 agh univ sci & t...
  • 1 篇 dorodnicyn compu...
  • 1 篇 russian acad sci...
  • 1 篇 agh univ sci & t...
  • 1 篇 sobolev inst mat...
  • 1 篇 lomonosov moscow...
  • 1 篇 mechanical engin...
  • 1 篇 novosibirsk stat...
  • 1 篇 moscow mv lomono...
  • 1 篇 sobolev inst mat...
  • 1 篇 tech univ munich...
  • 1 篇 russian acad sci...
  • 1 篇 federal research...
  • 1 篇 russian acad sci...

作者

  • 4 篇 djukova e. v.
  • 3 篇 mironov a. p.
  • 3 篇 vinogradov m. p.
  • 3 篇 milyukov v. k.
  • 2 篇 sotnezov r. m.
  • 2 篇 przybylowicz paw...
  • 2 篇 tsidulko oxana
  • 2 篇 myasnikov a. v.
  • 1 篇 schulte patrick
  • 1 篇 tsidulko o. yu
  • 1 篇 djukova e.v.
  • 1 篇 maslyakov g.o.
  • 1 篇 stepien lukasz
  • 1 篇 gimadi e. kh
  • 1 篇 przybyowicz pawe
  • 1 篇 myasnikov a. v
  • 1 篇 katuza andrzej
  • 1 篇 rykov ivan
  • 1 篇 dyukova e.v.
  • 1 篇 gimadi edward

语言

  • 19 篇 英文
检索条件"主题词=asymptotically optimal algorithm"
19 条 记 录,以下是11-20 订阅
排序:
optimal global approximation of jump-diffusion SDEs via path-independent step-size control
收藏 引用
APPLIED NUMERICAL MATHEMATICS 2018年 128卷 24-42页
作者: Kaluza, Andrzej Przybylowicz, Pawel AGH Univ Sci & Technol Fac Appl Math Mickiewicza 30 PL-30059 Krakow Poland
We provide a construction of an implementable method based on path-independent adaptive step-size control for global approximation of jump-diffusion SDEs. The sampling points are chosen in nonadaptive way with respect... 详细信息
来源: 评论
Monotone Dualization Problem and Its Generalizations: Asymptotic Estimates of the Number of Solutions
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2018年 第12期58卷 2064-2077页
作者: Djukova, E. V. Zhuravlev, Yu. I. Russian Acad Sci Fed Res Ctr Comp Sci & Control Dorodnicyn Comp Ctr Moscow 119333 Russia
Issues related to the construction of efficient algorithms for intractable discrete problems are studied. Enumeration problems are considered. Their intractability has two aspectsexponential growth of the number of th... 详细信息
来源: 评论
On asymptotically optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs  9th
On Asymptotically Optimal Approach to the m-Peripatetic Sale...
收藏 引用
9th International Conference on Discrete Optimization and Operations Research (DOOR)
作者: Gimadi, Edward Kh. Istomin, Alexey M. Tsidulko, Oxana Yu. Sobolev Inst Math 4 Acad Koptyug Ave Novosibirsk 630090 Russia Novosibirsk State Univ 2 Pirogova Str Novosibirsk 630090 Russia
We study the m-Peripatetic Salesman Problem on random inputs. In earlier papers we proposed a polynomial asymptotically optimal algorithm for the m-PSP with different weight functions on random inputs. The probabilist... 详细信息
来源: 评论
Constant Composition Distribution Matching
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2016年 第1期62卷 430-434页
作者: Schulte, Patrick Boecherer, Georg Tech Univ Munich Inst Commun Engn D-80333 Munich Germany
Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and ... 详细信息
来源: 评论
optimal global approximation of stochastic differential equations with additive Poisson noise
收藏 引用
NUMERICAL algorithmS 2016年 第2期73卷 323-348页
作者: Przybyowicz, Pawe AGH Univ Sci & Technol Fac Appl Math Al Mickiewicza 30 PL-30059 Krakow Poland
We consider strong global approximation of SDEs driven by a homogeneous Poisson process with intensity lambda > 0. We establish the exact convergence rate of minimal errors that can be achieved by arbitrary algorit... 详细信息
来源: 评论
asymptotically optimal dualization algorithms
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2015年 第5期55卷 891-905页
作者: Djukova, E. V. Prokofjev, P. A. Russian Acad Sci Dorodnicyn Comp Ctr Moscow 119333 Russia
The design of efficient on average algorithms for discrete enumeration problems is studied. The dualization problem, which is a central enumeration problem, is considered. New asymptotically optimal dualization algori... 详细信息
来源: 评论
On the complexity of the dualization problem
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2012年 第10期52卷 1472-1481页
作者: Djukova, E. V. Sotnezov, R. M. Russian Acad Sci Dorodnicyn Comp Ctr Moscow 119333 Russia
The computational complexity of discrete problems concerning the enumeration of solutions is addressed. The concept of an asymptotically efficient algorithm is introduced for the dualization problem, which is formulat... 详细信息
来源: 评论
Asymptotic estimates for the number of solutions of the dualization problem and its generalizations
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2011年 第8期51卷 1431-1440页
作者: Djukova, E. V. Sotnezov, R. M. Russian Acad Sci Dorodnicyn Comp Ctr Moscow 119333 Russia
Asymptotic estimates for the typical number of irreducible coverings and the typical length of an irreducible covering of a Boolean matrix are obtained in the case when the number of rows is no less than the number of... 详细信息
来源: 评论
On the construction of irredundant coverings of an integer matrix
收藏 引用
Computational Mathematics and Mathematical Physics 2007年 第3期47卷 518-526页
作者: Djukova, E.V. Public Opinion Foundation Moscow 119421 ul. Obrucheva 26-2 Russian Federation Dorodnicyn Computing Center Russian Academy of Sciences Moscow 119991 ul. Vavilova 40 Russian Federation
New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). © Nauka/Interp... 详细信息
来源: 评论