Sciweavers

11488 search results - page 398 / 2298
» Robust optimization - methodology and applications
Sort
View
WWW
2008
ACM
16 years 8 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
ICC
2009
IEEE
160views Communications» more  ICC 2009»
16 years 2 months ago
Application of Phase Shift in Coherent Multi-Relay MIMO Communications
—In this paper we propose a new low feedback and low complexity scheme that adjusts the phases at the relays, thus allowing for the coherent combining of signals from multiple re...
Yi Zheng, Hani Mehrpouyan, Steven D. Blostein
EMO
2009
Springer
147views Optimization» more  EMO 2009»
16 years 2 months ago
Application of MOGA Search Strategy to SVM Training Data Selection
When training Support Vector Machine (SVM), selection of a training data set becomes an important issue, since the problem of overfitting exists with a large number of training da...
Tomoyuki Hiroyasu, Masashi Nishioka, Mitsunori Mik...
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
16 years 1 months ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...
FAW
2009
Springer
144views Algorithms» more  FAW 2009»
16 years 7 days ago
Communication Complexity and Its Applications
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andrew Chi-Chih Yao