1603 search results - page 141 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
175
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
152
click to vote
IUI
2004
ACM
16 years 7 hour ago
2004
ACM
In many practical scenarios, users are faced with the problem of choosing the most preferred outcome from a large set of possibilities. As people are unable to sift through them m...
157
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
159
click to vote
HM
2007
Springer
16 years 22 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
160
click to vote
PODC
1999
ACM
15 years 11 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...