Sciweavers

109 search results - page 13 / 22
» Algorithm Selection as a Bandit Problem with Unbounded Losse...
Sort
View
ICDCS
2009
IEEE
13 years 5 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
TSP
2008
115views more  TSP 2008»
13 years 7 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
MSN
2007
Springer
124views Sensor Networks» more  MSN 2007»
14 years 1 months ago
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
Nastooh Taheri Javan, Mehdi Dehghan
EMO
2005
Springer
76views Optimization» more  EMO 2005»
14 years 27 days ago
Photonic Device Design Using Multiobjective Evolutionary Algorithms
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...
Steven Manos, Leon Poladian, Peter J. Bentley, Mar...
TCS
2010
13 years 5 months ago
Active learning in heteroscedastic noise
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
András Antos, Varun Grover, Csaba Szepesv&a...