Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22M%C3%A9thode minimax%22)

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 12100

  • Page / 484
Export

Selection :

  • and

*-MINIMAX performance in backgammonHAUK, Thomas; BURO, Michael; SCHAEFFER, Jonathan et al.Lecture notes in computer science. 2006, pp 51-66, issn 0302-9743, isbn 3-540-32488-7, 1Vol, 16 p.Conference Paper

The level set method of Joó and its use in minimax theoryFRENK, J. B. G; KASSAY, G.Mathematical programming. 2006, Vol 105, Num 1, pp 145-155, issn 0025-5610, 11 p.Article

Minimax regret portfolios for restricted stock sequencesCOVER, Thomas M.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 140Conference Paper

A two-function minimax theoremXIU-CHI QUAN.Journal of mathematical analysis and applications. 1994, Vol 185, Num 3, pp 660-674, issn 0022-247XArticle

Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I FunctionsAHMAD, I; HUSAIN, Z; SHARMA, S et al.Journal of optimization theory and applications. 2009, Vol 141, Num 1, pp 1-12, issn 0022-3239, 12 p.Article

On the Convergence of the Pshenichnyi-Pironneau-Polak Minimax Algorithm with an Active Set StrategyPOLAK, E.Journal of optimization theory and applications. 2008, Vol 138, Num 2, pp 305-309, issn 0022-3239, 5 p.Article

Probabilistic location problems with discrete demand weightsBERMAN, Oded; JIAMIN WANG.Networks (New York, NY). 2004, Vol 44, Num 1, pp 47-57, issn 0028-3045, 11 p.Article

A note on the minmax regret centdian location on treesCONDE, Eduardo.Operations research letters. 2008, Vol 36, Num 2, pp 271-275, issn 0167-6377, 5 p.Article

A minimax portfolio selection strategy with equilibriumDENG, Xiao-Tie; LI, Zhong-Fei; WANG, Shou-Yang et al.European journal of operational research. 2005, Vol 166, Num 1, pp 278-292, issn 0377-2217, 15 p.Article

Probabilistic Opponent-Model search in BaoDONKERS, Jeroen; VAN DEN HERIK, Jaap; UITERWIJK, Jos et al.Lecture notes in computer science. 2004, pp 409-419, issn 0302-9743, isbn 3-540-22947-7, 11 p.Conference Paper

A topological minimax theoremGRECO, G. H; HORVATH, C. D.Journal of optimization theory and applications. 2002, Vol 113, Num 3, pp 513-536, issn 0022-3239Article

MINIMAX ENTROPY SOLUTIONS OF ILL-POSED PROBLEMSGREENSITE, Fred.Quarterly of applied mathematics. 2009, Vol 67, Num 1, pp 137-161, issn 0033-569X, 25 p.Article

Minimax results and finite-dimensional separationFRENK, J. F. B; KASSAY, G.Journal of optimization theory and applications. 2002, Vol 113, Num 2, pp 409-421, issn 0022-3239Article

Variational inequalities, coincidence theory, and minimax inequalitiesAGARWAL, R. P; O'REGAN, D.Applied mathematics letters. 2001, Vol 14, Num 8, pp 989-996, issn 0893-9659Article

Computing the structured singular valueWATSON, G. A.SIAM journal on matrix analysis and applications. 1992, Vol 13, Num 4, pp 1054-1066, issn 0895-4798Article

Minimax arcsWILSON, B. J.Discrete mathematics. 1991, Vol 92, Num 1-3, pp 441-450, issn 0012-365XArticle

Universal minimax discrete denoising under channel uncertaintyGEMELOS, George; SIGURJONSSON, Styrmir; WEISSMAN, Tsachy et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 199Conference Paper

The path-packing structure of graphsSEBÖ, Andras; SZEGÖ, Laszlo.Lecture notes in computer science. 2004, pp 256-270, issn 0302-9743, isbn 3-540-22113-1, 15 p.Conference Paper

IL-22 : A critical mediator in mucosal host defenseAUJLA, S. J; KOLLS, J. K.Journal of molecular medicine (Berlin. Print). 2009, Vol 87, Num 5, pp 451-454, issn 0946-2716, 4 p.Article

Complexity of the min-max (regret) versions of cut problemsAISSI, Hassene; BAZGAN, Cristina; VANDERPOOTEN, Daniel et al.Lecture notes in computer science. 2005, pp 789-798, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Two-function topological minimax theoremsKINDLER, J.Journal of mathematical analysis and applications. 1998, Vol 225, Num 1, pp 312-325, issn 0022-247XArticle

Asymptotic expansion of the minimax value in survey samplingSTENGER, H.Metrika (Heidelberg). 1988, Vol 35, Num 2, pp 77-92, issn 0026-1335Article

A minimax property of linear regressionSCHWARZ, G.Journal of the American Statistical Association. 1987, Vol 82, Num 397, issn 0162-1459, 220Article

A min-max relation on packing feedback vertex setsXUJIN CHEN; GUOLI DING; XIAODONG HU et al.Lecture notes in computer science. 2005, pp 126-135, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Orthogonality of residual polynomials used in minimax polynomial preconditioningPEHERSTORFER, F.Numerische Mathematik. 1995, Vol 71, Num 3, pp 357-363, issn 0029-599XArticle

  • Page / 484