Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,319,837 papers from all fields of science
Search
Sign In
Create Free Account
Diffusing update algorithm
Known as:
DUAL FSM
, DUAL algorithm
, Dual
DUAL, the Diffusing Update ALgorithm, is the algorithm used by Cisco's EIGRP routing protocol to ensure that a given route is recalculated globally…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Algorithm
Bellman–Ford algorithm
Finite-state machine
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing
Weijie Shi
,
Linquan Zhang
,
Chuan Wu
,
Zongpeng Li
,
F. Lau
IEEE/ACM Transactions on Networking
2016
Corpus ID: 7292678
Auction mechanisms have recently attracted substantial attention as an efficient approach to pricing and allocating resources in…
Expand
2016
2016
Convergent Non-overlapping Domain Decomposition Methods for Variational Image Segmentation
Y. Duan
,
Huibin Chang
,
Xuecheng Tai
Journal of Scientific Computing
2016
Corpus ID: 5380310
This paper concerns with the non-overlapping domain decomposition methods (DDMs) for the Chan–Vese model in variational image…
Expand
Highly Cited
2012
Highly Cited
2012
Joint motion estimation and segmentation of complex scenes with label costs and occlusion modeling
M. Unger
,
Manuel Werlberger
,
T. Pock
,
H. Bischof
IEEE Conference on Computer Vision and Pattern…
2012
Corpus ID: 14951819
We propose a unified variational formulation for joint motion estimation and segmentation with explicit occlusion handling. This…
Expand
2009
2009
Maximum likelihood estimation of Gaussian graphical models : Numerical implementation and topology selection
Joachim Dahl
,
V. Roychowdhury
,
L. Vandenberghe
2009
Corpus ID: 14667254
We describe algorithms for maximum likelihood estimation of Gaussian graphical models with conditional independence constraints…
Expand
2008
2008
Group-Strategyproof Mechanisms for Network Design Games via Primal-Dual Algorithms
J. Könemann
,
S. Leonardi
,
G. Schäfer
,
David Wheatley
2008
Corpus ID: 15318081
About 15 years ago, Goemans and Williamson formally introduced the primal-dual framework for approximation algorithms and applied…
Expand
2005
2005
Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units
K. Jain
,
Mohammad Mahdian
Workshop on Internet and Network Economics
2005
Corpus ID: 17831
We study the problem of computing equilibrium prices in a Fisher market with linear utilities and linear single-constraint…
Expand
1997
1997
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem
Takahito Kuno
,
Takahiro Utsunomiya
Journal of Global Optimization
1997
Corpus ID: 3514462
In this paper, we propose a primal-dual algorithm for solving a class ofproduction-transportation problems. Among m(≥ 2) sources…
Expand
1989
1989
Dual Algorithms for Pure Network Problems
A. Ali
,
R. Padman
,
H. Thiagarajan
Operational Research
1989
Corpus ID: 20500795
This paper reports the development of a new algorithmic implementation of the dual algorithm for the capacitated minimum cost…
Expand
Highly Cited
1986
Highly Cited
1986
Distributed relaxation methods for linear network flow problems
D. Bertsekas
IEEE Conference on Decision and Control
1986
Corpus ID: 22343639
We consider distributed solution of the classical linear minimum cost network flow problem. We formulate a dual problem which is…
Expand
1975
1975
A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
H. Mukai
,
E. Polak
Mathematical programming
1975
Corpus ID: 39143448
This paper presents a globally convergent multiplier method which utilizes an explicit formula for the multiplier. The algorithm…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE