咨询与建议

限定检索结果

文献类型

  • 140 篇 期刊文献
  • 16 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 151 篇 工学
    • 106 篇 力学(可授工学、理...
    • 30 篇 电气工程
    • 26 篇 计算机科学与技术...
    • 13 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 2 篇 交通运输工程
    • 2 篇 软件工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 测绘科学与技术
    • 1 篇 石油与天然气工程
    • 1 篇 生物医学工程(可授...
  • 128 篇 理学
    • 111 篇 物理学
    • 14 篇 数学
    • 2 篇 统计学(可授理学、...
    • 1 篇 生物学
  • 1 篇 医学
    • 1 篇 临床医学
    • 1 篇 特种医学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 157 篇 message-passing ...
  • 42 篇 cavity and repli...
  • 29 篇 statistical infe...
  • 25 篇 random graphs
  • 25 篇 networks
  • 21 篇 analysis of algo...
  • 12 篇 disordered syste...
  • 8 篇 inference of gra...
  • 8 篇 spin glasses (th...
  • 8 篇 min-sum algorith...
  • 8 篇 machine learning
  • 7 篇 optimization ove...
  • 7 篇 learning theory
  • 6 篇 iterative decodi...
  • 5 篇 exact results
  • 5 篇 communication
  • 5 篇 max-product algo...
  • 5 篇 supply and infor...
  • 5 篇 network dynamics
  • 5 篇 low-density pari...

机构

  • 8 篇 univ roma la sap...
  • 5 篇 los alamos natl ...
  • 5 篇 los alamos natl ...
  • 4 篇 univ paris 11 f-...
  • 4 篇 politecn torino ...
  • 4 篇 wayne state univ...
  • 4 篇 politecn torino ...
  • 4 篇 human genet fdn ...
  • 3 篇 coll carlo alber...
  • 3 篇 cnrs ura 2306 f-...
  • 3 篇 kings coll londo...
  • 3 篇 duke univ dept e...
  • 3 篇 mit dept elect e...
  • 3 篇 stanford univ de...
  • 3 篇 univ paris sacla...
  • 3 篇 cnrs lptms f-914...
  • 3 篇 politecn torino ...
  • 3 篇 cens lab leon br...
  • 3 篇 santa fe inst sa...
  • 3 篇 stanford univ de...

作者

  • 20 篇 zdeborova lenka
  • 11 篇 krzakala florent
  • 7 篇 kabashima yoshiy...
  • 5 篇 braunstein a.
  • 5 篇 mezard marc
  • 5 篇 zecchina riccard...
  • 5 篇 semerjian guilhe...
  • 5 篇 chertkov michael
  • 5 篇 zecchina r.
  • 4 篇 moore cristopher
  • 4 篇 braunstein alfre...
  • 4 篇 zhang pan
  • 4 篇 van roy benjamin
  • 4 篇 moallemi ciamac ...
  • 4 篇 ricci-tersenghi ...
  • 3 篇 obuchi tomoyuki
  • 3 篇 banihashemi ah
  • 3 篇 pagnani andrea
  • 3 篇 altarelli f.
  • 3 篇 chernyak vladimi...

语言

  • 156 篇 英文
  • 1 篇 其他
检索条件"主题词=Message-passing algorithms"
157 条 记 录,以下是61-70 订阅
排序:
A message-passing algorithm with damping
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2005年 第11期2005卷 P11008-P11008页
作者: Pretti, M Politecn Torino Dipartimento Fis I-10129 Turin Italy
We propose a modified belief propagation algorithm, with overrelaxed dynamics. Such an algorithm turns out to be generally more stable and faster than ordinary belief propagation. We characterize the performance of th... 详细信息
来源: 评论
Fermions and loops on graphs: II. A monomer-dimer model as a series of determinants
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2008年 第12期2008卷 P12012-P12012页
作者: Chernyak, Vladimir Y. Chertkov, Michael Wayne State Univ Dept Chem Detroit MI 48202 USA Los Alamos Natl Lab Ctr Nonlinear Studies Los Alamos NM 87545 USA Los Alamos Natl Lab Div Theoret Los Alamos NM 87545 USA
We continue the discussion of the fermion models on graphs that started in the first paper of the series. Here we introduce a graphical gauge model (GGM) and show that: (a) it can be stated as an average/sum of a dete... 详细信息
来源: 评论
Percolation on the gene regulatory network
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2020年 第8期2020卷
作者: Torrisi, Giuseppe Kuhn, Reimer Annibale, Alessia Kings Coll London Dept Math London WC2R 2LS England
We consider a simplified model for gene regulation, where gene expression is regulated by transcription factors (TFs), which are single proteins or protein complexes. Proteins are in turn synthesised from expressed ge... 详细信息
来源: 评论
message passing for quantified Boolean formulas
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2012年 第05期2012卷 P05025-P05025页
作者: Zhang, Pan Ramezanpour, Abolfazl Zdeborova, Lenka Zecchina, Riccardo Politecn Torino I-10129 Turin Italy CEA Saclay IPhT F-91191 Gif Sur Yvette France CNRS URA 2306 F-91191 Gif Sur Yvette France
We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal va... 详细信息
来源: 评论
Recovering the state sequence of hidden Markov models using mean-field approximations
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2009年 第7期2009卷 P07026-P07026页
作者: Sinton, Antoine Ecole Normale Super Phys Theor Lab F-75231 Paris 05 France
Inferring the sequence of states from observations is one of the most fundamental problems in hidden Markov models. In statistical physics language, this problem is equivalent to computing the marginals of a one-dimen... 详细信息
来源: 评论
Practical optimization of Steiner trees via the cavity method
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2016年 第7期2016卷
作者: Braunstein, Alfredo Muntoni, Anna Politecn Torino DISAT Corso Duca Abruzzi 24 Turin Italy Human Genet Fdn Via Nizza 52 Turin Italy Coll Carlo Alberto Via Real Collegio 30 Moncalieri Italy
The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the minimum Steiner tree problem on graphs and variants. Max-Sum has been shown experimentally to giv... 详细信息
来源: 评论
Boolean constraint satisfaction problems for reaction networks
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2013年 第9期2013卷
作者: Seganti, A. De Martino, A. Ricci-Tersenghi, F. Univ Roma La Sapienza Dept Fis I-00185 Rome Italy Univ Roma La Sapienza Dept Fis UOS Roma IPCF CNR I-00185 Rome Italy Ist Italiano Tecnol Ctr Life Nano Sci Sapienza I-00161 Rome Italy Univ Roma La Sapienza Dept Fis Ist Nazl Fis Nucl Sez Roma 1 I-00185 Rome Italy
We define and study a class of (random) Boolean constraint satisfaction problems representing minimal feasibility constraints for networks of chemical reactions. The constraints we consider encode, respectively, for h... 详细信息
来源: 评论
Scaling of average receiving time and average weighted shortest path on weighted-crystal network
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2021年 第8期2021卷
作者: Li, Jun Li, Xiaoyan Sun, Yu Zhenjiang 1 High Sch Zhenjiang 212013 Jiangsu Peoples R China Jiangsu Univ Sch Math Sci Zhenjiang 212013 Jiangsu Peoples R China
In this paper, we focus on a network with even nodes named the weighted-crystal network, which is different from the regular iterative rules. By employing the self-similarity of the crystal network, we study and calcu... 详细信息
来源: 评论
Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2021年 第3期2021卷
作者: Zhao, Chun-Yan Fu, Yan-Rong Univ Shanghai Sci & Technol Coll Sci Shanghai 200093 Peoples R China
We propose three kinds of belief propagation (BP) guided decimation algorithms using asynchronous updating strategy to solve a prototype of random constraint satisfaction problem with growing domains referred to as mo... 详细信息
来源: 评论
Spectral bounds for the Ising ferromagnet on an arbitrary given graph
收藏 引用
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT 2017年 第5期2017卷
作者: Saade, Alaa Krzakala, Florent Zdeborova, Lenka PSL Univ CNRS UMR 8550 Lab Phys Stat F-75005 Paris France Ecole Normale Super F-75005 Paris France UPMC Univ Paris 06 Sorbonne Univ Paris France Univ Calif Berkeley Simons Inst Theory Comp Berkeley CA 94720 USA Univ Paris Saclay CEA CNRS Inst Phys Theor F-91191 Gif Sur Yvette France
We revisit classical bounds of Fisher on the ferromagnetic Ising model (Fisher 1967 Phys. Rev. 162 480), and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition functio... 详细信息
来源: 评论