Results 1  10
of
1,679
RealTime Systems
, 2000
"... Collision avoidance is an important topic in multirobot systems. Existing multirobot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same timestep) [1, 3, 4], and allow diagonal move between ..."
Abstract

Cited by 602 (11 self)
 Add to MetaCart
between two adjacent nodes (e.g., Figure 1(b)). However, in many real world applications, sideswipe collisions may also block robots ’ movements or cause deadlocks. For example, as shown in Figure 1, if the size of two robots is as big as the grid size they occupied, collisions will happen not only
TimeOptimal Graph Algorithms for Finding Adjacent and NonAdjacent Nodes on a Completely Overlapping Network
"... AbstractA completely overlapping network (CON) is an extension of LANs with several overlapping communication lines. Given a graph G = (V, E) where V is a set of vertices and E is a set of edges, and a set of vertices V ′ ⊆ V, we show that finding adjacent and nonadjacent nodes in V ′ on CON can ..."
Abstract
 Add to MetaCart
AbstractA completely overlapping network (CON) is an extension of LANs with several overlapping communication lines. Given a graph G = (V, E) where V is a set of vertices and E is a set of edges, and a set of vertices V ′ ⊆ V, we show that finding adjacent and nonadjacent nodes in V ′ on CON can
GPSLess Low Cost Outdoor Localization for Very Small Devices.
 IEEE Personal Communications Magazine,
, 2000
"... AbstractInstrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where ..."
Abstract

Cited by 1000 (27 self)
 Add to MetaCart
AbstractInstrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
Virtual cutthrough: a new computer communication switching technique
 Computer Networks
, 1979
"... In this paper a new switching technique called virtual cutthrough is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediate node and its selected outgoing channel is free (just after th ..."
Abstract

Cited by 377 (4 self)
 Add to MetaCart
the reception of the header), then, in contrast o message switching, the message is sent out to the adjacent node towards its destination before it is received completely at the node; only if the message isblocked due to a busy output channel is a message buffered in an intermediate node. Therefore, the delay
A CLASS OF INEQUALITIES RELATING DEGREES OF ADJACENT NODES TO THE AVERAGE DEGREE IN EDGEWEIGHTED UNIFORM HYPERGRAPHS
, 2005
"... In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less than the average degree in the hypergraph, wi ..."
Abstract
 Add to MetaCart
In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less than the average degree in the hypergraph
A cluster method for finding node sets / subnetworks based on betweennode similarity in sets of adjacency nodes: with application in finding subnetworks in tumor pathways
, 2016
"... Abstract A network consists of node sets or subnetworks. In present study, a cluster method for finding node sets / subnetworks according to betweennode similarity in sets of adjacency nodes was proposed. A typical example demonstrated that the method is highly effective. Subnetworks in tumor p ..."
Abstract
 Add to MetaCart
Abstract A network consists of node sets or subnetworks. In present study, a cluster method for finding node sets / subnetworks according to betweennode similarity in sets of adjacency nodes was proposed. A typical example demonstrated that the method is highly effective. Subnetworks in tumor
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., nonhierarchical edge ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a Bspline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
Distributed QualityofService Routing in AdHoc Networks
 IEEE Journal on Selected Areas in Communications
, 1999
"... In an adhoc network, all communication is done over wireless media, typically by radio through air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The qualityofservice (QoS) routing in an ad ..."
Abstract

Cited by 299 (4 self)
 Add to MetaCart
In an adhoc network, all communication is done over wireless media, typically by radio through air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The qualityofservice (QoS) routing in an ad
Results 1  10
of
1,679