Sciweavers

5 search results - page 1 / 1
» Decomposability of Polytopes
Sort
View
DCG
2008
70views more  DCG 2008»
13 years 4 months ago
Decomposability of Polytopes
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
Krzysztof Przeslawski, David Yost
DCG
2000
59views more  DCG 2000»
13 years 4 months ago
Decomposing the Secondary Cayley Polytope
T. Michiels, Ronald Cools
CCCG
2008
13 years 6 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
INFOCOM
2006
IEEE
13 years 10 months ago
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
Lijun Chen, Steven H. Low, Mung Chiang, John C. Do...
MP
2008
99views more  MP 2008»
13 years 4 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph