Sciweavers

1110 search results - page 91 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
SPIRE
2010
Springer
14 years 9 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 5 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn
COR
2008
112views more  COR 2008»
14 years 11 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
14 years 11 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
CDC
2010
IEEE
134views Control Systems» more  CDC 2010»
14 years 6 months ago
Observer design for Lipschitz systems with discrete-time measurements
In this paper, the authors investigate the problem of designing an observer for Lipschitz nonlinear systems with discrete time measurements (continuous-discrete time systems). The ...
Vincent Andrieu, Madiha Nadri