Sciweavers

3663 search results - page 530 / 733
» Problems in the ontology of computer programs
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 3 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 11 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
15 years 6 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
JMLR
2008
168views more  JMLR 2008»
15 years 6 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
WWW
2009
ACM
16 years 7 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...