1603 search results - page 76 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
179
click to vote
WECWIS
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper studies adaptive bilateral negotiation between software agents in e-commerce environments. Specifically, we assume that the agents are self-interested, the environment...
178
click to vote
AAAI
2011
14 years 6 months ago
2011
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
178
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
234
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this paper, we introduce a higher-order MRF optimization
framework. On the one hand, it is very general;
we thus use it to derive a generic optimizer that can be applied
to a...
162
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...