Sciweavers

334 search results - page 16 / 67
» Approximation Algorithms for Non-Uniform Buy-at-Bulk Network...
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
14 years 3 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
AUTOMATICA
2006
98views more  AUTOMATICA 2006»
13 years 8 months ago
Stabilization of sampled-data nonlinear systems via backstepping on their Euler approximate model
Two integrator backstepping designs are presented for digitally controlled continuous-time plants in special form. The controller designs are based on the Euler approximate discre...
Dragan Nesic, Andrew R. Teel
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 10 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
OA
1989
237views Algorithms» more  OA 1989»
14 years 22 days ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph