Some simple design problems for distributed organizations Daniel C. Lee, John N. Tsitsiklis.

Some simple design problems for distributed organizations Daniel C. Lee, John N. Tsitsiklis.

Includes bibliographical references (p. 10).

Bibliographic Details
Other Authors:	Lee, Daniel C.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Subjects:	TK7855.M41 E3845 no.2090
Online Access:	http://hdl.handle.net/1721.1/3251

Similar Items

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

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

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

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

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

Dynamic weapon-target assignment problems with vulnerable C2Ì³ nodes
Published: (2003)

Some solutions, some problems, and some questions
Published: (2002)

A simple and fast label correcting algorithm for shortest paths
Published: (2003)

A very simple polynomial-time algorithm for linear programming
Published: (2003)

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

A simple bisection algorithm for the L2 induced norm of a sample-data system
Published: (2003)

Some complexity results about packet radio networks
Published: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Published: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Published: (2004)

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)

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

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

Variational problems in SBV
Published: (2003)

The auction algorithm for the transportation problem
Published: (2003)

Lyapunov exponents for filtering problems
Published: (2003)

An auction algorithm for the max-flow problem
Published: (2003)

An analysis of stochastic shortest path problems
Published: (2003)

Stochastic shortest path problems with recourse
Published: (2003)

The dynamic weapon-target assignment problem
Published: (2003)

Rollout algorithms for stochastic scheduling problems
Published: (2003)

The asymptotic Toeplitz-circulant eigenvalue problem
Published: (2003)

Signaling and uncertainty : c case study
Published: (2002)

A simple polynomial-time algorithm for convex quadratic programming
Published: (2003)

A unified approach to the vehicle-merging problem
Published: (2002)

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

Parallel asynchronous Hungarian methods for the assignment problem
Published: (2003)

An iterative coordination approach to decentralized decision problems
Published: (2002)

Measures of effectiveness and C3 testbed experiments
Published: (2003)

The auction algorithm for assignment and other network flow problems
Published: (2003)

Existence theory for a new class of variational problems
Published: (2003)

The auction algorithm for the minimum cost network flow problem
Published: (2003)

An operator-theoretic approach to the mixed-sensitivity minimization problem
Published: (2003)

Efficient algorithms for continuous-space shortest path problems
Published: (2003)

Application of the EM algorithm for the multitarget/multisensor tracking problem
Published: (2003)