1603 search results - page 104 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
150
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
This paper examines a problem related to the optimal risk management of banks in a stochastic dynamic setting. In particular, we minimize7 market and capital adequacy risk that in...
143
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
The methods of reconstruction of perception based functions (PBF) given by the set of rules like “If X is SMALL then Y is VERY QUICKLY INCREASING”, “If X is BETWEEN A and B ...
199
click to vote
ECRTS
2006
IEEE
16 years 12 days ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
200
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
154
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The fitness landscape of a problem is the relation between the solution candidates and their reproduction probability. In order to understand optimization problems, it is essenti...