Sciweavers

3049 search results - page 360 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
DISOPT
2008
138views more  DISOPT 2008»
15 years 6 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
ISCI
2010
128views more  ISCI 2010»
15 years 5 months ago
Robust static output feedback controller synthesis using Kharitonov's theorem and evolutionary algorithms
This paper presents a simple but effective tuning strategy for robust static output feedback (SOF) controllers with minimal quadratic cost in the context of multiple parametric un...
Rosario Toscano, Patrick Lyonnet
MASS
2010
159views Communications» more  MASS 2010»
15 years 1 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia
FOCS
2009
IEEE
16 years 1 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
INFOCOM
2008
IEEE
16 years 1 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff