Добірка наукової літератури з теми "Maxmin"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Maxmin".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Maxmin":
Kokol Bukovšek, Damjana, Tomaž Košir, Blaž Mojškerc, and Matjaž Omladič. "Asymmetric linkages: Maxmin vs. reflected maxmin copulas." Fuzzy Sets and Systems 393 (August 2020): 75–95. http://dx.doi.org/10.1016/j.fss.2019.07.004.
Tang, Rui, and Mu Zhang. "Maxmin implementation." Journal of Economic Theory 194 (June 2021): 105250. http://dx.doi.org/10.1016/j.jet.2021.105250.
Geanakoplos, John D. "Afriat from MaxMin." Economic Theory 54, no. 3 (November 2013): 443–48. http://dx.doi.org/10.1007/s00199-013-0783-x.
Maccheroni, Fabio. "Maxmin under risk." Economic Theory 19, no. 4 (June 1, 2002): 823–31. http://dx.doi.org/10.1007/s001990100167.
von Stengel, Bernhard, and Daphne Koller. "Team-Maxmin Equilibria." Games and Economic Behavior 21, no. 1-2 (October 1997): 309–21. http://dx.doi.org/10.1006/game.1997.0527.
Guo, Huiyi, and Nicholas C. Yannelis. "Full Implementation under Ambiguity." American Economic Journal: Microeconomics 13, no. 1 (February 1, 2021): 148–78. http://dx.doi.org/10.1257/mic.20180184.
Amin, Raid W., and Kuiyuan Li. "The MaxMin EWMA tolerance limits." International Journal of Quality & Reliability Management 17, no. 1 (February 2000): 27–41. http://dx.doi.org/10.1108/02656710010283351.
Prisman, Eliezer Z. "Immunization as a maxmin strategy." Journal of Banking & Finance 10, no. 4 (December 1986): 491–509. http://dx.doi.org/10.1016/s0378-4266(86)80002-4.
Shibaev, S. V. "Maxmin subject to marginal constraints." Cybernetics and Systems Analysis 30, no. 6 (November 1994): 875–84. http://dx.doi.org/10.1007/bf02366446.
Alon, Shiri, and David Schmeidler. "Purely subjective Maxmin Expected Utility." Journal of Economic Theory 152 (July 2014): 382–412. http://dx.doi.org/10.1016/j.jet.2014.03.006.
Дисертації з теми "Maxmin":
Léo, Bruno Beltrão. "Maxmin with multiple tastes and beliefs." reponame:Repositório Institucional da UnB, 2016. http://repositorio.unb.br/handle/10482/20734.
Submitted by Fernanda Percia França (fernandafranca@bce.unb.br) on 2016-06-03T17:25:07Z No. of bitstreams: 1 2016_BrunoBeltraoLeo.pdf: 257152 bytes, checksum: d2e63d33f2dc389397cf4d20f3d50a73 (MD5)
Approved for entry into archive by Raquel Viana(raquelviana@bce.unb.br) on 2016-06-15T18:43:44Z (GMT) No. of bitstreams: 1 2016_BrunoBeltraoLeo.pdf: 257152 bytes, checksum: d2e63d33f2dc389397cf4d20f3d50a73 (MD5)
Made available in DSpace on 2016-06-15T18:43:44Z (GMT). No. of bitstreams: 1 2016_BrunoBeltraoLeo.pdf: 257152 bytes, checksum: d2e63d33f2dc389397cf4d20f3d50a73 (MD5)
Neste trabalho, apresentamos uma axiomatização de um modelo de preferências completas sob incerteza que propicia uma multiplicidade de gostos (utilidades) e crenças (priors). Tal qual Gilboa e Schmeidler (1989), trabalhamos em um set-up de Anscombe-Aumann e cada ato é avaliado pelo pior cenário. A diferença é que, enquanto no modelo de Gilboa e Schmeidler (1989) os múltiplos cenários são compostos de um conjunto de crenças, aqui eles serão representados por um conjunto formado de pares crenças-utilidades. Axiomatizamos, também, o caso especial quando os múltiplos cenários resultam apenas de uma multiplicidade de utilidades. _______________________________________________________________________________________________ ABSTRACT
In this work, we present an axiomatization of a model of complete preferences under uncertainty that allows for a multiplicity of tastes and beliefs. As in Gilboa and Schmeidler (1989), we work in an Anscombe-Aumann setup and each act is evaluated by the worst case scenario. The difference is that while in Gilboa and Schmeidler (1989) the multiple scenarios are composed of a set of priors, here they are composed of a set of probability-utility pairs. We axiomatize also the special case when the multiple scenarios are a consequence of the multiplicity of tastes only.
Patel, Ebrahim. "Maxmin-plus models of asynchronous computation." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/maxminplus-models-of-asynchronous-computation(148d3056-2309-48c2-887f-42743949ae03).html.
Hartmann, L. "Perceived ambiguity, ambiguity attitude and strategic ambiguity in games." Thesis, University of Exeter, 2019. http://hdl.handle.net/10871/35581.
Kelmendi, Edon. "Two-Player Stochastic Games with Perfect and Zero Information." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0238/document.
We consider stochastic games that are played on finite graphs. The subject of the first part are two-player stochastic games with perfect information. In such games the two players take turns choosing actions from a finite set, for an infinite duration, resulting in an infinite play. The objective of the game is given by a Borel-measurable and bounded payoff function that maps infinite plays to real numbers. The first player wants to maximize the expected payoff, and the second player has the opposite objective, that of minimizing the expected payoff. We prove that if the payoff function is both shift-invariant and submixing then the game is half-positional. This means that the first player has an optimal strategy that is at the same time pure and memoryless. Both players have perfect information, so the actions are chosen based on the whole history. In the second part we study finite-duration games where the protagonist player has zero information. That is, he gets no feedback from the game and consequently his strategy is a finite word over the set of actions. Probabilistic finite automata can be seen as an example of such a game that has only a single player. First we compare two classes of probabilistic automata: leaktight automata and simple automata, for which the value 1 problem is known to be decidable. We prove that simple automata are a strict subset of leaktight automata. Then we consider half-blind games, which are two player games where the maximizer has zero information and the minimizer is perfectly informed. We define the class of leaktight half-blind games and prove that it has a decidable maxmin reachability problem
Ozturk, Aybuke. "Design, Implementation and Analysis of a Description Model for Complex Archaeological Objects." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE2048/document.
Ceramics are one of the most important archaeological materials to help in the reconstruction of past civilizations. Information about complex ceramic objects is composed of textual, numerical and multimedia data, which induce several research challenges addressed in this thesis. From a technical perspective, ceramic databases have different file formats, access protocols and query languages. From a data perspective, ceramic data are heterogeneous and experts have differentways of representing and storing data. There is no standardized content and terminology, especially in terms of description of ceramics. Moreover, data navigation and observation are difficult. Data integration is also difficult due to the presence of various dimensions from distant databases, which describe the same categories of objects in different ways.Therefore, the research project presented in this thesis aims to provide archaeologists and archaeological scientists with tools for enriching their knowledge by combining different information on ceramics. We divide our work into two complementary parts: (1) Modeling of Complex Archaeological Data and (2) Clustering Analysis of Complex Archaeological Data. The first part of this thesis is dedicated to the design of a complex archaeological database model for the storage of ceramic data. This database is also used to source a data warehouse for doing online analytical processing (OLAP). The second part of the thesis is dedicated to an in-depth clustering (categorization) analysis of ceramic objects. To do this, we propose a fuzzy approach, where ceramic objects may belong to more than one cluster (category). Such a fuzzy approach is well suited for collaborating with experts, by opening new discussions based on clustering results.We contribute to fuzzy clustering in three sub-tasks: (i) a novel fuzzy clustering initialization method that keeps the fuzzy approach linear; (ii) an innovative quality index that allows finding the optimal number of clusters; and (iii) the Multiple Clustering Analysis approach that builds smart links between visual, textual and numerical data, which assists in combining all types ofceramic information. Moreover, the methods we propose could also be adapted to other application domains such as economy or medicine
Silva, Adriano Jeronimo da. "Leilões de certificados de energia eletrica : maximo excedente versus maxima quantidade negociada." [s.n.], 2003. http://repositorio.unicamp.br/jspui/handle/REPOSIP/264537.
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica
Made available in DSpace on 2018-08-03T19:46:48Z (GMT). No. of bitstreams: 1 Silva_AdrianoJeronimoda_M.pdf: 616881 bytes, checksum: 151659c0f2ddd2abe2a87c2801f205d8 (MD5) Previous issue date: 2003
Mestrado
Li, Junkang. "Games with incomplete information : complexity, algorithmics, reasoning." Electronic Thesis or Diss., Normandie, 2023. http://www.theses.fr/2023NORMC270.
In this dissertation, we study games with incomplete information. We begin by establishing a complete landscape of the complexity of computing optimal pure strategies for different subclasses of games, when games are given explicitly as input. We then study the complexity when games are represented compactly (e.g.\ by their game rules). For this, we design two formalisms for such compact representations. Then we concentrate on games with incomplete information, by first proposing a new formalism called combinatorial game with incomplete information, which encompasses games of no chance (apart from a random initial drawing) and with only public actions. For such games, this new formalism captures the notion of information and knowledge of the players in a game better than extensive form. Next, we study algorithms and their optimisations for solving combinatorial games with incomplete information; some of these algorithms are applicable beyond these games. In the last part, we present a work in progress that concerns the modelling of recursive reasoning and different types of knowledge about the behaviour of the opponents in games with incomplete information
Philippe, Maxime. "Impact des composés oxygènes modèles issus d'une huile de pyrolyse de biomasse sur l'hydrodésulfuration des dibenzothiophènes." Poitiers, 2010. http://theses.edel.univ-poitiers.fr/theses/2010/Philippe-Maxime/2010-Philippe-Maxime-These.pdf.
The lignocellulosic material is a new potential source to produce diesel fuels. However, this material contains significant amounts of oxygen which is necessary to eliminate through a process hydrodeoxygenation that can be achieved during the hydrodesulfurization (HDS) of diesel fuels. This represents the advantage of using hydrotreating units available in the refinery. To highlight the complex interactions between sulfur and oxygen molecules, the impact of model oxygenated compounds (guaiacol, phenol, CO, CO2 and decanoic acid) on the conversion of model compounds representative of those sulfur content in diesel (dibenzothiophene (DBT) and 4,6-dimethyldibenzothiophene (46DMDBT)) was evaluated under HDS operating conditions (340°C, 4 MPa, CoMoP/Al2O3). The transformation of DBT and 46DMDBT requires the two main routes involves in HDS process (direct C-S bond rupture: DSD and hydrogenation of aromatic rings followed by C-S bond rupture:HYD). A negative impact of oxygenates on the HDS of dibenzothiophenes has been showed and corresponds to a competitive adsorption between the sulfur and oxygenated compounds on the catalyst surface. The negative impact depends on the oxygenated and sulfur molecules. Indeed, the inhibition was more significant in the presence of decanoic acid than CO and more especially than guaiacol and phenol. Phenol has a similar effect on both ways (HYD and DSD), in contrast to guaiacol, which leads to a greater inhibition of the HYD pathway. Decanoic acid and CO have a more substantial impact on the direct C-S bonds
Yang, Dong-Hyeuk Kwon Hyuck M. "Frequency offset effects on Maximin and MOSTLE." Diss., Click here for available full-text of this thesis, 2006. http://library.wichita.edu/digitallibrary/etd/2006/t025.pdf.
"July 2006." Title from PDF title page (viewed on October 2, 2006). Thesis adviser: Hyuck M. Kwon. Includes bibliographic references (leaves 39-40).
Haines, Sheena Ayla. "Convex relaxations of the maximin dispersion problem." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/38242.
Книги з теми "Maxmin":
Bevers, Michael. Formulating MAXMIN objectives in national forest planning models. Fort Collins, Colo. (240 W. Prospect Rd., Ft. Collins 80526): U.S. Dept. of Agriculture, Forest Service, Rocky Mountain Forest and Range Experiment Station, 1993.
Bevers, Michael. Formulating MAXMIN objectives in national forest planning models. Fort Collins, Colo. (240 W. Prospect Rd., Ft. Collins 80526): U.S. Dept. of Agriculture, Forest Service, Rocky Mountain Forest and Range Experiment Station, 1993.
Karlitch, Johnny. Maximun Max, Prince of Peaks: Inspired by the Adventures of Maxime Chaya. Beirut: Hachette Antoine, 2022.
Bezner, Frank. Von der Liturgie zur Geschichte: Die Riesenbibel von St. Maximin und die Historia Excidii Sancti Maximini. Ramsen, Schweiz: Heribert Tenschert, 2011.
Pino, Marina. Maxín y Maxín. Madrid: Espasa Calpe, 1994.
Zhukovskiĭ, Vladislav Iosifovich. The vector-valued maximin. Boston: Academic Press, 1994.
François, La Rochefoucauld. Maxims. South Bend, Indiana: St. Augustine's Press, 2001.
Stephen. Maxims. Kalamazoo, Mich: Cistercian Publications, 2002.
Cantemir, Dimitrie. Maxime. Chișinău: Cartea Moldovei, 2003.
Cantemir, Dimitrie. Maxime. Chișinău: Cartea Moldovei, 2003.
Частини книг з теми "Maxmin":
Washburn, Alan. "Maxmin Versus Minmax." In International Series in Operations Research & Management Science, 5–13. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-9050-0_2.
Fekete, S´andor P., Winfried Hellmann, Michael Hemmer, Arne Schmidt, and Julian Troegel. "Computing MaxMin Edge Length Triangulations." In 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX), 55–69. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973754.6.
Patel, Ebrahim L. "Complexity of Maxmin- $$\omega $$ Cellular Automata." In Unifying Themes in Complex Systems IX, 98–107. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96661-8_10.
Öztürk, Aybüke, Stéphane Lallich, Jérôme Darmont, and Sylvie Yona Waksman. "MaxMin Linear Initialization for Fuzzy C-Means." In Machine Learning and Data Mining in Pattern Recognition, 1–15. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96136-1_1.
Yanovskaya, Elena. "Lexicographical Maxmin Core Solutions for Cooperative Games." In Lecture Notes in Economics and Mathematical Systems, 125–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-48773-6_9.
Zhu, Binhai, and Xiaotie Deng. "On Computing and Drawing Maxmin-Height Covering Triangulation." In Graph Drawing, 464–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_48.
Kelmendi, Edon, and Hugo Gimbert. "Deciding Maxmin Reachability in Half-Blind Stochastic Games." In Algorithmic Game Theory, 52–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53354-3_5.
Audet, Charles, Pierre Hansen, Brigitte Jaumard, and Gilles Savard. "On the Linear Maxmin and Related Programming Problems." In Multilevel Optimization: Algorithms and Applications, 181–208. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-0307-7_8.
Patel, Ebrahim L. "Maxmin- $$\omega $$ : A Simple Deterministic Asynchronous Cellular Automaton Scheme." In Lecture Notes in Computer Science, 192–98. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44365-2_19.
Balbás, Alejandro, and Alfredo Ibáñez. "Maxmin Portfolios in Models Where Immunization is Not Feasible." In Applied Optimization, 139–65. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3613-7_8.
Тези доповідей конференцій з теми "Maxmin":
García-Soriano, David, and Francesco Bonchi. "Maxmin-Fair Ranking." In KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3447548.3467349.
Sreedurga, Gogulapati, Mayank Ratan Bhardwaj, and Yadati Narahari. "Maxmin Participatory Budgeting." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/70.
Yan, Li-rong, and Yi-bo Wu. "MaxMin: An Unbiased Outlier Detection Method." In 2015 2nd International Conference on Information Science and Control Engineering (ICISCE). IEEE, 2015. http://dx.doi.org/10.1109/icisce.2015.73.
Lee, Tae Hee, and Jae Jun Jung. "Maxmin Engenvalue Sampling of Kriging Model." In 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2004. http://dx.doi.org/10.2514/6.2004-4488.
Bateni, MohammadHossein, Moses Charikar, and Venkatesan Guruswami. "MaxMin allocation via degree lower-bounded arborescences." In the 41st annual ACM symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1536414.1536488.
Tsai, Wei, Pohao Huang, Thomas Liau, and Dan-han Tsai. "Theory of Multi-Path Maxmin Rate Allocation." In 2006 14th IEEE International Conference on Networks. IEEE, 2006. http://dx.doi.org/10.1109/icon.2006.302617.
Köppen, Mario, Masato Tsuru, and Yuji Oie. "Evolutionary Approach to Maxmin-Fair Network-Resource Allocation." In 2008 International Symposium on Applications and the Internet. IEEE, 2008. http://dx.doi.org/10.1109/saint.2008.91.
Aziz, Haris, Hau Chan, and Bo Li. "Weighted Maxmin Fair Share Allocation of Indivisible Chores." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/7.
Kawanabe, M., C. Vidaurre, S. Scholler, and K. R. Muller. "Robust common spatial filters with a maxmin approach." In 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE, 2009. http://dx.doi.org/10.1109/iembs.2009.5334786.
Koppen, Mario, Rodrigo Verschae, Kaori Yoshida, and Masato Tsuru. "Heuristic Maxmin Fairness for the Wireless Channel Allocation Problem." In 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA 2010). IEEE, 2010. http://dx.doi.org/10.1109/bwcca.2010.141.
Звіти організацій з теми "Maxmin":
Dumont, R., Z. Bardossy, and W. Miles. MAXIMA: software to determine local maxima from gridded data. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2015. http://dx.doi.org/10.4095/296957.
Семеріков, Сергій Олексійович, Ілля Олександрович Теплицький та Світлана Вікторівна Шокалюк. Maxima – система комп’ютерної математики для вітчизняної системи освіти. НПУ імені М.П. Драгоманова, 2008. http://dx.doi.org/10.31812/0564/915.
Ramos, Octavio Jr. Eric Martinez: Maxing out on life. Office of Scientific and Technical Information (OSTI), October 2019. http://dx.doi.org/10.2172/1573324.
Семеріков, Сергій Олексійович, та Ілля Олександрович Теплицький. Огляд інтерфейсів системи комп’ютерної математики Maxima. [б.в.], 2006. http://dx.doi.org/10.31812/0564/813.
Семеріков, Сергій Олексійович, та Ілля Олександрович Теплицький. Розробка гіпертекстового довідника з системи Maxima для підтримки факультативного курсу «Комп’ютерні технології в наукових дослідженнях». Бердянський державний педагогічний університет, вересень 2005. http://dx.doi.org/10.31812/0564/996.
Ros, Gerard H., Henk Janssen, Nicole Bartelds, and Henri Holster. Uitwerking concept MaxiMi : op weg naar resultaatgestuurd mestbeleid? Wageningen: Wageningen Environmental Research, 2018. http://dx.doi.org/10.18174/461897.
Peterson, T. Liquid Argon Maximm Convective Heat Flux vs. Liquid Depth. Office of Scientific and Technical Information (OSTI), January 1990. http://dx.doi.org/10.2172/1031856.
Shyshkina, Mariya, and Uliana Kohut. The Method of Using the Maxima System for Operations Research Learning. [б. в.], June 2019. http://dx.doi.org/10.31812/123456789/3172.
Siegmund, David. Approximate Tail Probabilities for the Maxima of Some Random Fields. Fort Belvoir, VA: Defense Technical Information Center, August 1986. http://dx.doi.org/10.21236/ada172729.
Kohut, Uliana, and Mariya Shyshkina. Providing the Fundamentalisation of Operations Research Learning Using MAXIMA System. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4464.