Sciweavers

175 search results - page 26 / 35
» Lower Bounds for Dynamic Algebraic Problems
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 14 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
JCP
2007
102views more  JCP 2007»
13 years 7 months ago
Deterministic Models of an Active Magnetic Bearing System
— In this paper the development of mathematical model of voltage-input and current-input active magnetic bearing (AMB) system in deterministic form is presented. The AMB system, ...
Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Hali...
ICASSP
2011
IEEE
12 years 11 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
PODC
2010
ACM
13 years 6 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...