• Aucun résultat trouvé

min-max

Pseudo-polynomial algorithms for min-max and min-max regret problems

Pseudo-polynomial algorithms for min-max and min-max regret problems

... Keywords: min-max, min-max regret, computational complexity, ...In min-max optimization, the aim is to find a solution having the best worst case value across all ...In ...

8

Complexity of the min-max (regret) versions of cut problems

Complexity of the min-max (regret) versions of cut problems

... of min-max (regret) versions of two closely related polynomial problems, min cut and s − t min ...precisely, min-max (regret) versions of min cut are polynomial whereas ...

11

SEMIDEFINITE PROGRAMMING FOR MIN-MAX PROBLEMS AND GAMES

SEMIDEFINITE PROGRAMMING FOR MIN-MAX PROBLEMS AND GAMES

... two min-max problems: (1) minimizing the supre- mum of finitely many rational functions over a compact basic semi-algebraic set and (2) solving a 2-player zero-sum polynomial game in randomized strate- gies ...

24

Approximating min-max (regret) versions of some polynomial problems

Approximating min-max (regret) versions of some polynomial problems

... Keywords: min-max, min-max regret, approximation, fptas, shortest path, min- imum spanning ...the min-max and min-max regret criteria, stemming from decision ...

10

Dirac-Coulomb operators with general charge distribution. I. Distinguished extension and min-max formulas

Dirac-Coulomb operators with general charge distribution. I. Distinguished extension and min-max formulas

... the min-max formulas was shown for one-center Dirac operators in [8] in the domain of the distinguished extension and then in H 1/2 (R 3 ) in [27, ...the min-max methods in H 1/2 (R 3 , C 4 ) ...

33

Relaxation schemes for min max generalization in deterministic batch mode reinforcement learning

Relaxation schemes for min max generalization in deterministic batch mode reinforcement learning

... We study the min max optimization problem introduced in [6] for computing policies for batch mode reinforcement learning in a deterministic setting. This problem is NP-hard. We focus on the two-stage case ...

6

Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack

Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack

... for min-max (max-min) and min-max regret versions of shortest path, knapsack, and minimum spanning tree on grid graphs ...for min-max and min-max ...

12

Direct-Search for a Class of Stochastic Min-Max Problems

Direct-Search for a Class of Stochastic Min-Max Problems

... of min-max saddle point games where one sequentially updates the min and the max ...the max-player satisfies the Polyak- Lojasiewicz (PL) condition, while the min- player is ...

12

Towards min max generalization in reinforcement learning

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

A Hölderian backtracking method for min-max and min-min problems

A Hölderian backtracking method for min-max and min-min problems

... Abstract We present a new algorithm to solve min-max or min-min problems out of the convex world. We use rigidity assumptions, ubiquitous in learning, making our method applicable to many ...

20

A MIN-MAX PATH APPROACH FOR BALANCING ROBOTIC ASSEMBLY LINES WITH SEQUENCE-DEPENDENT SETUP TIMES

A MIN-MAX PATH APPROACH FOR BALANCING ROBOTIC ASSEMBLY LINES WITH SEQUENCE-DEPENDENT SETUP TIMES

... We propose a method of type Sequence-First Balance- And-Select-Second to tackle this problem. This method relies on a novel algorithm, called minmax, that computes a min-max path in some auxiliary graph. We ...

11

Domains for Dirac-Coulomb min-max levels

Domains for Dirac-Coulomb min-max levels

... DIRAC-COULOMB MIN-MAX LEVELS MARIA ...of min-max formulas for the eigenvalues in the spectral gap of D V , in a range of simple function spaces independent of V ...

45

Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier

Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier

... the min-max edge orientation problem with an approximation ratio strictly smaller than γ requires Ω( log n log γ ) communication rounds, where n is the number of nodes in the underlying graph (n ...

12

The ridge method for tame min-max problems

The ridge method for tame min-max problems

... results Min-max problems arise in machine learning applications with Generative Adversarial Networks (GANs) [27, 6], adversarial training of deep networks [34, 28], and further applications [1] bolstering ...

29

A min-max certainty equivalence principle, and its applications to continuous time, sampled data, and discrete time H optimal control

A min-max certainty equivalence principle, and its applications to continuous time, sampled data, and discrete time H optimal control

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

37

Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities.

Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities.

... Suppose N \ W k is infinite and ψ m is a total recursive function such that ψ m ≥ growth N \W k . Then there are 2 2|p|+1 elements of N \ W k which are ≤ ψ m (2 2|p|+1 ). As above, there is necessarily some such element ...

42

A Min-Max certainty equivalence principle for non-linear discrete-time control problems

A Min-Max certainty equivalence principle for non-linear discrete-time control problems

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

16

Navier-Stokes dynamical shape control : from state derivative to Min-Max principle

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

Min/max time limits and energy penalty of communication scheduling in ring-based ONoC

Min/max time limits and energy penalty of communication scheduling in ring-based ONoC

... For the example presented in this section, we consider a FSR equal to 0.8 nm and, as mentioned before, an optimal repartition of wavelengths onto this interval. Fig. 3. Execution times comparison for min vs ...

7

Analyse de systemes MIN-MAX

Analyse de systemes MIN-MAX

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

7

Show all 275 documents...

Sujets connexes