min and max function
Pseudo-polynomial algorithms for min-max and min-max regret problems
... Keywords: min-max, min-max regret, computational complexity, ...objective function coefficients, which may be uncertain or ...Kouvelis and Yu [2] proposed the maximum cost ...
8
Approximating min-max (regret) versions of some polynomial problems
... Keywords: min-max, min-max regret, approximation, fptas, shortest path, min- imum spanning ...objective function coefficients, which may be uncertain or ...lower and an ...
10
Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities.
... ’s and ask for λ A-recursive. (∗∗) Consider the W A i ’s and ask for λ ...sets and partial A-recursive functions ...recursive function which does not depend on ...
42
The ridge method for tame min-max problems
... 14] and a many further properties are available [14, 29, ...a function being semialgebraic when its graph can be represented as the finite union of solution sets of polynomial systems involving finitely ...
29
Max-Min Lyapunov Functions for Switching Differential Inclusions
... Lyapunov function by taking the maxi- mum, minimum, or the combination of both; see Definition 3 for ...Such max-min type of Lyapunov functions were recently proposed in the context of discrete-time ...
7
Max-Min Lyapunov Functions for Switched Systems and Related Differential Inclusions
... Lyapunov function for systems (1) and (2) which guarantees asymptotic stability of the origin {0} ⊂ R n ...Such max-min type of Lyapunov functions were recently proposed in the context of ...
27
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... IS, and RIS2, for some ratio values. As one can see from Tables 2 and 3, Algorithm RIS2 dominates Algorithm RIS1 since, in fact, the former is a refinement of the ...α(G), and using an exact ...
26
Min-Max Coverage in Multi-interface Networks
... trivial and it is solved by code lines 2–3 of the ...3 and all the nodes can activate all their interfaces to accomplish the coverage task (code lines ...interfaces and all the edges connecting nodes ...
13
Complexity of the min-max (regret) versions of cut problems
... 4.2 Min-max regret versions When the number u ≤ m of uncertain/imprecise parameters, corresponding to non-degenerate intervals, is small enough, then the problem becomes ...Averbakh and Lebedev [5] ...
11
Direct-Search for a Class of Stochastic Min-Max Problems
... a function f (x) without hav- ing access to its gradient ∇f ...strategies and population-based algorithms that have demonstrated promising results in reinforcement learn- ing (Salimans et ...2018) ...
12
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
... Keywords: min-max, min-max regret, approximation, fptas, shortest path, mi- nimum spanning tree, ...objective function coefficients, which may be uncertain or ...lower and an ...
12
A Hölderian backtracking method for min-max and min-min problems
... d max y∈Y L(x, y), (1.1) where Y is a constraint set, and L is a given cost ...optimization and game theory, but generally under assumptions that are not those met in ...approach and duality ...
20
Towards min max generalization in reinforcement learning
... a min max approach for address- ing the generalization problem in Reinforcement ...The min max approach works by determining a sequence of actions that maximizes the worst return that could ...
18
Domains for Dirac-Coulomb min-max levels
... DIRAC-COULOMB MIN-MAX LEVELS MARIA J. ESTEBAN, MATHIEU LEWIN, AND ´ ERIC S´ ER ´ E ...Esteban and Loss. Then we prove the validity of min-max formulas for the eigenvalues in the ...
45
Max Jacob peintre
... lettre à René Rimbert que certains commentateurs ont pris trop au sérieux 64 : Jacob y affirme avec beaucoup d’humour et un peu d’humeur n’avoir pas fait de cubisme, parce qu’il aimait la beauté et la sensualité ! En ...
17
Navier-Stokes dynamical shape control : from state derivative to Min-Max principle
... Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex France Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois - [r] ...
61
Relaxation schemes for min max generalization in deterministic batch mode reinforcement learning
... Acknowledgments Raphael Fonteneau is a postdoctoral fellow of the FRS-FNRS. This paper presents research results of the European Network of Excellence PASCAL2 and the Belgian Network DYSCO funded by the ...
6
lambda-Min Decoding Algorithm of Regular and Irregular LDPC Codes
... degree and high ...(optimal) and BP-based ...algorithm and we propose a parity check processor which enables to compute effi- ciently the λ−min algorithm and which reduces the memory ...
5