Sciweavers

3211 search results - page 153 / 643
» On the Grundy Number of a Graph
Sort
View
ICTAI
2000
IEEE
15 years 10 months ago
Consistency checking for Euclidean spatial constraints: a dimension graph approach
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
Xuan Liu, Shashi Shekhar, Sanjay Chawla
IMCSIT
2010
15 years 4 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
CORR
2011
Springer
194views Education» more  CORR 2011»
15 years 1 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
SIAMJO
2010
87views more  SIAMJO 2010»
15 years 1 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
15 years 28 days ago
Optimal network topology design in multi-agent systems for efficient average consensus
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
Mohammad Rafiee, Alexandre M. Bayen