Skip to search formSkip to main contentSkip to account menu

Local algorithm

A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network.
Wikipedia (opens in a new tab)

Related topics

Related topics

1 relation
Algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Jerk bounded velocity planner for the online management of autonomous vehicles
The velocity planner for autonomous vehicles proposed in this paper is designed for the automatic generation of trajectories… 
2014
2014
Directional relays without voltage sensors for distribution networks
In this study, algorithms for directional relays using only current measurements are presented. Developed for radial distribution… 
Highly Cited
2012
Highly Cited
2012
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
2011
2011
Real-time stereo on GPGPU using progressive multi-resolution adaptive windows
2007
2007
Finding large and small dense subgraphs
We consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to… 
1999
1999
On global, local, mixed and neighborhood kernels for support vector machines
1997
1997
An improved Metropolis algorithm for hard core systems
1996
1996
Model-checking of infinite graphs defined by graph grammars
1991
1991
Global and local date reduction strategies for cubic splines
  • U. Wever
  • Comput. Aided Des.
  • 1991
  • Corpus ID: 8456945
1981
1981
Generalized cones from serial sections
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)