Some complexity results about packet radio networks

Some complexity results about packet radio networks

Cover title.

Bibliographic Details
Other Authors:	ArÄ±kan, Erdal.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology 2003
Subjects:	TK7855.M41 E3845 no.1284
Online Access:	http://hdl.handle.net/1721.1/2850

Similar Items

Finding small dominating sets in stationless mobile packet radio networks Abhay K. Parekh.
Published: (2002)

Two interfering queues in packet-radio networks
Published: (2002)

Tandem packet-radio queueing networks Moshe Sidi.
Published: (2002)

Wavelet packet based transient signal classification
Published: (2003)

Wavelet-packet-based multiple access communication
Published: (2003)

A wavelet packet approach to transient signal classification
Published: (2003)

Clustering in packet radio networks
Published: (2002)

Multinode broadcast in hypercubes and rings with randomly distributed length of packets
Published: (2002)

Some results on the problem of exit from a domain
Published: (2003)

Convergence study of an iterative joint detector for wavelet packet multiple-access communication
Published: (2003)

Examination of wavelet packet signal sets for over-saturated multiple access communications
Published: (2003)

Some analytical results for the dynamic weapon-target allocation problem
Published: (2003)

The complexity of optimal queueing network control
Published: (2003)

Some issues in distributed asynchronous routing in virtual circuit data networks
Published: (2003)

On some aspects of random walks for modelling mobility in a communication network
Published: (2002)

A busy-tone-multiple-access-type scheme for packet-radio networks
Published: (2003)

On the predictability of coupled automata : an allegory about chaos
Published: (2003)

Some properties of optimal thresholds in decentralized detection
Published: (2003)

Explicit solutions for some simple decentralized detection problems
Published: (2003)

NP-hardness of some linear control design problems
Published: (2003)

Effects of organizational structure on performance : experimental results
Published: (2003)

Scaling results for the variational approach to edge detection
Published: (2002)

A survey of some aspects of parallel and distributed iterative algorithms
Published: (2003)

Some discrete approximations to a variational method for image segmentation
Published: (2002)

The complexity of Markov decision processes
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

Ergodic control of multidimensional diffusions I. : the existence results
Published: (2003)

Some min-max optimization problems in infinite-dimensional control systems
Published: (2003)

The information-based complexity of dynamic programming
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)

An asymptotic result for the multi-stage weapon-target allocation problem
Published: (2003)

Complexity theoretic aspects of problems in control theory
Published: (2003)

Complexity of stability and controllability of elementary hybrid systems
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

The time complexity of maximum matching by simulated annealing
Published: (2003)

On the communication complexity of solving a polynominal equation
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

Infinite dimensionality results for trajectory MAP estimation based on the Malliavin calculus
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2002)

Some simple design problems for distributed organizations Daniel C. Lee, John N. Tsitsiklis.
Published: (2003)