Advanced Search
DSpace@MIT

Browsing MIT Open Access Articles by Title

Research and Teaching Output of the MIT Community

Browsing MIT Open Access Articles by Title

Sort by: Order: Results:

  • Eryilmaz, Atilla; Ozdaglar, Asuman E.; Shah, Devavrat; Modiano, Eytan H. (Institute of Electrical and Electronics Engineers, 2010-04)
    In this paper, we provide and study a general framework that facilitates the development of distributed mechanisms to achieve full utilization of multihop wireless networks. In particular, we describe a generic randomized ...
  • Agaskar, Ameya P.; He, Ting; Tong, Lang (Institute of Electrical and Electronics Engineers, 2010-05)
    The problem of detecting multihop information flows subject to communication constraints is considered. In a distributed detection scheme, eavesdroppers are deployed near nodes in a network, each able to measure the ...
  • Gattami, Ather Said (Institute of Electrical and Electronics Engineers, 2009-06)
    In this paper we study distributed estimation and control problems over graphs under partially nested information patterns. We show a duality result that is very similar to the classical duality result between state ...
  • Dimarogonas, Dimos V.; Frazzoli, Emilio (Institute of Electrical and Electronics Engineers, 2010-01)
    Event-driven strategies for distributed multi-agent systems are motivated by the future use of embedded microprocessors with limited resources that will gather information and actuate the individual agent controller updates. ...
  • Le Ny, Jerome; Balakrishnan, Hamsa (Institute of Electrical and Electronics Engineers, 2009-06)
    This paper proposes an Eulerian model of traffic flows in the National Airspace System (NAS) and presents a distributed feedback control approach for managing the flows. The main contribution is the development of a model ...
  • Keshet, Aviv; Ketterle, Wolfgang (American Institute of Physics (AIP), 2013-01)
    Atomic physics experiments often require a complex sequence of precisely timed computer controlled events. This paper describes a distributed graphical user interface-based control system designed with such experiments in ...
  • Ghaffari, Mohsen; Musco, Cameron Nicholas; Radeva, Tsvetomira T.; Lynch, Nancy Ann (Association for Computing Machinery (ACM), 2015-07)
    We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. ...
  • Perreault, David J.; Kassakian, John G. (Institute of Electrical and Electronics Engineers (IEEE), 1997-08)
    This paper introduces a distributed approach to interleaving paralleled power converter cells. Unlike conventional methods, the distributed approach requires no centralized control, automatically accommodates varying numbers ...
  • Chowdhary, Girish; Vian, John; Ure, N. Kemal; Chen, Yu Fan; How, Jonathan P. (Springer Netherlands, 2013-11)
    This paper considers the problem of multiagent sequential decision making under uncertainty and incomplete knowledge of the state transition model. A distributed learning framework, where each agent learns an individual ...
  • Sorin, Fabien; Lestoquoy, Guillaume; Danto, Sylvain; Joannopoulos, John D.; Fink, Yoel (Optical Society of America, 2010-05)
    We report on a photoconductive fiber that supports decaying and convex electrical potential profiles capable of localizing a point of illumination, and propose a scheme to perform distributed optical sensing.
  • Roozbehani, Mardavij; Megretski, Alexandre; Frazzoli, Emilio; Feron, Eric (Spring Berlin/Heidelberg, 2008-07)
    In previous works, the authors introduced a framework for software analysis, which is based on optimization of Lyapunov invariants. These invariants prove critical software properties such as absence of overflow and ...
  • Lobel, Ilan; Ozdaglar, Asuman E.; Feijer Rovira, Diego Francisco (Springer-Verlag, 2011-06)
    We study distributed algorithms for solving global optimization problems in which the objective function is the sum of local objective functions of agents and the constraint set is given by the intersection of local ...
  • Alonso-Mora, Javier; Montijano, Eduardo; Schwager, Mac; Rus, Daniela L. (Institute of Electrical and Electronics Engineers (IEEE), 2016-05)
    This paper presents a distributed method for navigating a team of robots in formation in 2D and 3D environments with static and dynamic obstacles. The robots are assumed to have a reduced communication and visibility radius ...
  • Wei, Ermin; Eryilmaz, Atilla; Jadbabaie, Ali; Ozdaglar, Asuman E. (Institute of Electrical and Electronics Engineers (IEEE), 2012-03)
    The standard Network Utility Maximization (NUM) problem has a static formulation, which fails to capture the temporal dynamics in modern networks. This work considers a dynamic version of the NUM problem by introducing ...
  • Jadbabaie, Ali; Ozdaglar, Asuman E.; Zargham, Michael (Institute of Electrical and Electronics Engineers, 2009-12)
    Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate properties. This paper proposes an alternative ...
  • Wei, Ermin; Ozdaglar, Asuman E.; Jadbabaie, Ali (Institute of Electrical and Electronics Engineers, 2010-12)
    Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of convergence properties. This work develops an ...
  • Dai, Wenhan; Shen, Yuan; Win, Moe Z. (Institute of Electrical and Electronics Engineers (IEEE), 2015-01)
    Device-to-device (D2D) communication in cellular networks is a promising concept that permits cooperation among mobile devices not only to increase data throughput but also to enhance localization services. In those networks, ...
  • Jiang, Libin; Shah, Devavrat; Shin, Jinwoo; Walrand, Jean (Institute of Electrical and Electronics Engineers, 2010-11)
    This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier sense multiple access (CSMA) algorithms where the random access (or backoff) parameter of each node is adjusted dynamically. ...
  • Boerkoel, James; Durfee, Edmund H. (Association for the Advancement of Artificial Intelligence, 2013-05)
    This research focuses on building foundational algorithms for scheduling agents that assist people in managing their activities in environments where tempo and complex activity interdependencies outstrip people's cognitive ...
  • Misra, Vinith; Goyal, Vivek K.; Varshney, Lav Raj (Institute of Electrical and Electronics Engineers (IEEE), 2011-07)
    Communication of quantized information is frequently followed by a computation. We consider situations of distributed functional scalar quantization: distributed scalar quantization of (possibly correlated) sources followed ...
Open Access