Sciweavers

2925 search results - page 365 / 585
» Information Complexity of Online Problems
Sort
View
AUTOMATICA
2006
112views more  AUTOMATICA 2006»
15 years 4 months ago
Joint identification of plant rational models and noise distribution functions using binary-valued observations
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and limitations for systems with limited sensor inform...
Le Yi Wang, Gang George Yin, Ji-Feng Zhang
EOR
2006
88views more  EOR 2006»
15 years 4 months ago
Nonessential objectives within network approaches for MCDM
In Gal and Hanne [Eur. J. Oper. Res. 119 (1999) 373] the problem of using several methods to solve a multiple criteria decision making (MCDM) problem with linear objective functio...
Tomas Gal, Thomas Hanne
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 11 months ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov
175
Voted
SIGIR
2012
ACM
13 years 7 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
WWW
2009
ACM
16 years 5 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...