1603 search results - page 180 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
203
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
184
click to vote
EUROGP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
162
click to vote
IANDC
2006
15 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
153
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
173
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...