4962 search results - page 731 / 993 » Connectivity in Sub-Poisson Networks |
152
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
170
click to vote
FPGA
1998
ACM
15 years 11 months ago
1998
ACM
The goal of this paper is to perform a timing optimization of a circuit described by a network of cells on a target structure whose connection delays have discrete values following...
144
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
172
click to vote
AI50
2006
15 years 10 months ago
2006
Compressing real-time input through bandwidth constrained connections has been studied within robotics, wireless sensor networks, and image processing. When there are bandwidth con...
196
click to vote
CCCG
2010
15 years 8 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...