Results 241 to 250 of about 1,791,029 (281)

Distributed sensor self-localization

48th Midwest Symposium on Circuits and Systems, 2005., 2005
In this paper, we propose a new decentralized, or distributed, sensor self-localization scheme where no central processing unit is required. Computation of the required tasks is distributed throughout the network and performed at each sensor, requiring only local communications among a few neighboring sensors.
H.H. Fan, J.J. Caffery, null Chunpeng Yan   +2 more
openaire   +1 more source

Locality in Distributed Graph Algorithms

SIAM Journal on Computing, 1992
The paper deals with distributed solutions of graph problems. The model assumes that each node of the graph is occupied by a processor that has a unique ID number. Moreover, the computation is reliable, synchronous, and communication is accomplished by message passing along the edges of the graph. Let \(\text{diam}(G)\) denote the diameter of the graph
openaire   +2 more sources

Distributional Issues in Local Taxation

The Economic Journal, 1991
The introduction of the Community Charge, a poll tax, in place of the local tax on domestic property ('domestic rates') in Britain has highlighted important issues of both equity and efficiency in local government finance. The Government's own analysis, set out in a Green Paper issued at the start of i986,2 stressed the efficiency objectives of the ...
openaire   +1 more source

Locality in distributed computations

Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
The defining characteristic of a distributed system is the (temporal) distance between components; communication time is non-trivial compared to processing time. Because of this, the design of efficient distributed computations involves trade-offs between maximizing the amount of parallelism and minimizing communication costs. We argue that any sort of
David K. Garnick, A. Toni Cohen
openaire   +1 more source

Localized Distributivity Conditions

1995
Various conditions have been used in lieu of full two-sided distributivity to obtain structure theory for near-rings, most successful and most widely known being the distributively generated condition, but also including a plethora of other conditions, some being quite exotic.
openaire   +1 more source

Local Distributed Agent Matchmaking

2001
This paper explores through simulation an abstract model of distributed matchmaking within multi-agent systems. We show that under certain conditions agents can find matches for cooperative tasks without the help of a predefined organization or central facilitator.
Elth Ogston, Stamatis Vassiliadis
openaire   +1 more source

Web-based distributed robot localization

Science Robotics
Web-based strategy enables robots to communicate estimated locations among robot peers.
openaire   +2 more sources

Localized charge distributions

Theoretica Chimica Acta, 1975
Walter England, Mark S. Gordon, Klaus Ruedenberg   +2 more
openaire   +1 more source

Distributed Localization

2008
Shashi Shekhar, Hui Xiong
openaire   +1 more source

Distributed Localization

2015
Rosario Aragues, Carlos Sagues, Youcef Mezouar   +2 more
openaire   +1 more source