WorldCat Identities
Thu Oct 16 17:53:49 2014 UTClccn-n880653790.66Intractable problems in control theory /0.750.97Stability conditions for multiclass fluid queueing networks /20017037n 880653792226029lccn-n81114321Bertsekas, Dimitri P.orglccn-n97042423Bertsimas, Dimitrislccn-no90025493Center for Intelligent Control Systems (U.S.)lccn-n80015259Massachusetts Institute of TechnologyLaboratory for Information and Decision Systemsfndnp-stamoulis, g dStamoulis, G. D.viaf-193880276Bertsimas, Dimitris, christos hPapadimitriou, Christos, ioannis chPaschalidis, Ioannis Chnp-luo, zhi quanLuo, Zhi-Quannp-chow, chee sengChow, Chee-SengTsitsiklis, John N.Mathematical optimizationParallel processing (Electronic computers)Electronic data processing--Distributed processingLinear programmingDynamic programmingNeural networks (Computer science)ProbabilitiesStochastic processesRandom variablesAlgorithmsQueuing theoryOperating systems (Computers)Control theoryComputational complexityNeural computersMarkov processesSignal processing--Digital techniquesComputer networksElectroreceptorsDetectorsStochastic approximationAdaptive control systemsComputer network protocolsSystem analysisIterative methods (Mathematics)Operations researchVector processing (Computer science)195819811982198319841985198619871988198919901991199219931994199519961997199819992002200820091612107251004.35QA76.553420ocn017727079book19890.70Bertsekas, Dimitri PParallel and distributed computation : numerical methodsMathematics of Computing -- Parallelism+-+46547013363029ocn036686772book19970.74Bertsimas, DimitrisIntroduction to linear optimization26418ocn051441829book20020.77Bertsekas, Dimitri PIntroduction to probability+-+K59470133626010ocn035983505book19960.77Bertsekas, Dimitri PNeuro-dynamic programming86ocn020180702book19880.96Chow, Chee-SengAn optimal multigrid algorithm for continuous state discrete time stochastic control64ocn021402780book19900.92Pippenger, NicholasOn a lower bound for the redundancy of reliable networks with noisy gates64ocn035571506book19900.96Tsitsiklis, John NOn the average communication complexity of asynchronous distributed algorithmsAbstract: "We study the communication complexity of asychronous distributed algorithms, such as the distributed Bellman-Ford algorithm for the shortest path problem. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average."61ocn016634034book19840.82Tsitsiklis, John NThe throughput of a precedence-based queuing discipline53ocn031729779book19940.97Bertsimas, Dimitris JOn the large deviations behaviour of acyclic networks of G/G/1 queues55ocn021696119book19870.97Tsitsiklis, John NDecentralized detectionAbstract: "Consider a set of sensors that receive observations from the environment and transmit finite-valued messages to a fusion center that makes a final decision on one out of M alternative hypotheses. The problem is to provide rules according to which the sensors should decide what to transmit, in order to optimize a measure of organizational performance. We overview the available theory for the Bayesian formulation, and improve upon the known results for the Neyman-Pearson variant of the problem54ocn024687448book19910.95Luo, Z. QData fusion with minimal communication54ocn030066961book19930.92Tsitsiklis, John NEfficient algorithms for globally optimal trajectories51ocn016634056book19840.66Papadimitriou, Christos HIntractable problems in control theory54ocn031914640book19940.97Bertsimas, Dimitris JStability conditions for multiclass fluid queueing networks43ocn021588738book19900.92Buss, Samuel ROn the predictability of coupled automata : an allegory about chaos43ocn028152491book19920.97Bertsimas, Dimitris JOptimization of multiclass queueing networks : polyhedral and nonlinear characterizations of achievable performance43ocn021402825book19900.97Stamoulis, G. DEfficient routing schemes for multiple broadcasts in hypercubes43ocn019682945book19880.96Tsitsiklis, John NA comparison of Jacobi and Gauss-Seidel parallel iterations42ocn019276831book19880.92Tseng, PaulPartially asychronous, parallel algorithms for network flow and other problems43ocn020413957book19890.92Stamoulis, G. DOn the settling time of the congested G/G/1 queue+-+K594701336+-+K594701336Thu Oct 16 14:58:49 EDT 2014batch12720