Sciweavers

96 search results - page 17 / 20
» Linearity, Non-determinism and Solvability
Sort
View
MST
2010
140views more  MST 2010»
13 years 6 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
TMC
2010
100views more  TMC 2010»
13 years 6 months ago
Optimal Relay Station Placement in Broadband Wireless Access Networks
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...
Bin Lin, Pin-Han Ho, Liang-Liang Xie, Xuemin (Sher...
MP
2008
99views more  MP 2008»
13 years 7 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
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 5 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
14 years 1 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens