Sciweavers

3250 search results - page 213 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ADHOCNOW
2004
Springer
15 years 12 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
CPAIOR
2006
Springer
15 years 10 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
MOBIHOC
2004
ACM
16 years 6 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
154
Voted
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
16 years 17 days ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
152
Voted
ISCAS
2003
IEEE
97views Hardware» more  ISCAS 2003»
15 years 11 months ago
Optimal design of FIR frequency-response-masking filters using second-order cone programming
Since Limís 1986 paper on the frequency-response masking (FRM) technique for the design of FIR digital Ýlters with very small transition widths, the analysis and design of FRM ...
Wu-Sheng Lu, Takao Hinamoto