Relevant bibliographies by topics / Minmax approach

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Minmax approach'

Author: Grafiati
Published: 4 June 2021
Last updated: 2 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Minmax approach.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Minmax approach"

1

Bor-Sen Chen and Shueun-Shyang Wang. "Optimal model matching control systems: Minmax approach." IEEE Transactions on Automatic Control 32, no. 6 (June 1987): 518–21. http://dx.doi.org/10.1109/tac.1987.1104654.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tabor, Zbisław. "Surrogate data: A novel approach to object detection." International Journal of Applied Mathematics and Computer Science 20, no. 3 (September 1, 2010): 545–53. http://dx.doi.org/10.2478/v10006-010-0040-4.

Full text
Abstract:
Surrogate data: A novel approach to object detectionIn the present study a novel method is introduced to detect meaningful regions of a gray-level noisy images of binary structures. The method consists in generating surrogate data for an analyzed image. A surrogate image has the same (or almost the same) power spectrum and histogram of gray-level values as the original one but is random otherwise. Then minmax paths are generated in the original image, each characterized by its length, minmax intensity and the intensity of the starting point. If the probability of the existence of a path with the same characteristics but within surrogate images is lower than some user-specified threshold, it is concluded that the path in the original image passes through a meaningful object. The performance of the method is tested on images corrupted by noise with varying intensity.
APA, Harvard, Vancouver, ISO, and other styles
3

Creß, Ulrike, and Helmut Felix Friedrich. "Selbst gesteuertes Lernen Erwachsener." Zeitschrift für Pädagogische Psychologie 14, no. 4 (December 2000): 194–205. http://dx.doi.org/10.1024//1010-0652.14.4.194.

Full text
Abstract:
Zusammenfassung: Auf der Basis von Lernstrategie-, Motivations- und Selbstkonzeptvariablen wurden 724 Fernstudierende clusteranalytisch zu vier mehrdimensionalen Typen selbst gesteuerten Lernens gruppiert. «Tiefenverarbeiter» und «Wiederholer» entsprechen weitgehend den in der Literatur beschriebenen Lernorientierungen «deep» und «surface approach». Auch zu den Clustern «Minimal-Lerner» und «Minmax-Lerner» lassen sich in der Literatur - allerdings schwächere - Entsprechungen finden. Die Validierung der Cluster erbrachte u. a., dass «Tiefenverarbeiter» und «Minmax-Lerner» höheres Vorwissen, höhere Bildungsabschlüsse, eine geringere Tendenz zum Studienabbruch sowie höheren Lernerfolg aufweisen als «Wiederholer» und «Minimal-Lerner». «Tiefenverarbeiter» und «Minmax-Lerner» scheinen ihren überdurchschnittlichen Lernerfolg auf entgegengesetzte Weise zu erreichen: «Tiefenverarbeiter» durch ausgeprägten Strategie- und hohen Zeiteinsatz, «Minmax-Lerner» durch geringen Strategie- und Zeiteinsatz. Die Berücksichtigung der Lerneffizienz, d. h. des Zusammenspiels von Lernleistung und Lernzeit, eröffnet neue Fragestellungen für die Beschreibung und Interpretation der Lernertypen.
APA, Harvard, Vancouver, ISO, and other styles
4

Lygeros, John. "Infinite Horizon Minmax Optimal Control: A Viability Approach." IFAC Proceedings Volumes 36, no. 6 (June 2003): 265–70. http://dx.doi.org/10.1016/s1474-6670(17)36442-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Carrizosa, Emilio, and Dolores Romero-Morales. "Combining Minsum And Minmax: A Goal Programming Approach." Operations Research 49, no. 1 (February 2001): 169–74. http://dx.doi.org/10.1287/opre.49.1.169.11190.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zemkoho, Alain B. "A simple approach to optimality conditions in minmax programming." Optimization 63, no. 3 (January 30, 2012): 385–401. http://dx.doi.org/10.1080/02331934.2011.653788.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kuang, Juhong. "Variational Approach to Quasi-Periodic Solution of Nonautonomous Second-Order Hamiltonian Systems." Abstract and Applied Analysis 2012 (2012): 1–14. http://dx.doi.org/10.1155/2012/271616.

Full text
Abstract:
We deal with the quasi-periodic solutions of the following second-order Hamiltonian systemsx¨(t)=∇F(t,x(t)), wherex(t)=(x1(t),…,xN(t)), and we present a new approach via variational methods and Minmax method to obtain the existence of quasi-periodic solutions to the above equation.
APA, Harvard, Vancouver, ISO, and other styles
8

Ibri, Sarah, Mohammed EL Amin Cherabrab, and Nasreddine Abdoune. "Parallel Scatter Search Approach for the MinMax Regret Location Problem." International Journal of Applied Metaheuristic Computing 9, no. 2 (April 2018): 1–17. http://dx.doi.org/10.4018/ijamc.2018040101.

Full text
Abstract:
In this paper we propose an efficient solving method based on a parallel scatter search algorithm that accelerates the search time to solve the minmax regret location problem. The algorithm was applied in the context of emergency management to locate emergency vehicles stations. A discrete event simulator was used to test the quality of the obtained solutions on the operational level. We compared the performance of the algorithm to an existing two stages method, and experiments show the efficiency of the proposed method in terms of quality of solution as well as the gain in computation time that could be obtained by parallelizing the proposed algorithm.
APA, Harvard, Vancouver, ISO, and other styles
9

LI, B., K. L. TEO, G. H. ZHAO, and G. R. DUAN. "AN EFFICIENT COMPUTATIONAL APPROACH TO A CLASS OF MINMAX OPTIMAL CONTROL PROBLEMS WITH APPLICATIONS." ANZIAM Journal 51, no. 2 (October 2009): 162–77. http://dx.doi.org/10.1017/s1446181110000040.

Full text
Abstract:
AbstractIn this paper, an efficient computation method is developed for solving a general class of minmax optimal control problems, where the minimum deviation from the violation of the continuous state inequality constraints is maximized. The constraint transcription method is used to construct a smooth approximate function for each of the continuous state inequality constraints. We then obtain an approximate optimal control problem with the integral of the summation of these smooth approximate functions as its cost function. A necessary condition and a sufficient condition are derived showing the relationship between the original problem and the smooth approximate problem. We then construct a violation function from the solution of the smooth approximate optimal control problem and the original continuous state inequality constraints in such a way that the optimal control of the minmax problem is equivalent to the largest root of the violation function, and hence can be solved by the bisection search method. The control parametrization and a time scaling transform are applied to these optimal control problems. We then consider two practical problems: the obstacle avoidance optimal control problem and the abort landing of an aircraft in a windshear downburst.
APA, Harvard, Vancouver, ISO, and other styles
10

Köster, Andreas M., Jorge M. del Campo, Florian Janetzko, and Bernardo Zuniga-Gutierrez. "A MinMax self-consistent-field approach for auxiliary density functional theory." Journal of Chemical Physics 130, no. 11 (March 21, 2009): 114106. http://dx.doi.org/10.1063/1.3080618.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Minmax approach"

1

Assavapokee, Tiravat. "Semi-Continuous Robust Approach for Strategic Infrastructure Planning of Reverse Production Systems." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/7945.

Full text
Abstract:
Growing attention is being paid to the problem of efficiently designing and operating reverse supply chain systems to handle the return flows of production wastes, packaging, and end-of-life products. Because uncertainty plays a significant role in all fields of decision-making, solution methodologies for determining the strategic infrastructure of reverse production systems under uncertainty are required. This dissertation presents innovative optimization algorithms for designing a robust network infrastructure when uncertainty affects the outcomes of the decisions. In our context, robustness is defined as minimizing the maximum regret under all realization of the uncertain parameters. These new algorithms can be effectively used in designing supply chain network infrastructure when the joint probability distributions of key parameters are unknown. These algorithms only require the information on potential ranges and possible discrete values of uncertain parameters, which often are available in practice. These algorithms extend the state of the art in robust optimization, both in the structure of the problems they address and the size of the formulations. An algorithm for dealing with the problem with correlated uncertain parameters is also presented. Case studies in reverse production system infrastructure design are presented. The approach is generalizable to the robust design of network supply chain systems with reverse production systems as one of their subsystems.
APA, Harvard, Vancouver, ISO, and other styles
2

Šandera, Čeněk. "Heuristické algoritmy pro optimalizaci." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2008. http://www.nusl.cz/ntk/nusl-228326.

Full text
Abstract:
Práce se zabývá určením pravděpodobnostních rozdělení pro stochastické programování, při kterém jsou optimální hodnoty účelové funkce extrémní (minimální nebo maximální). Rozdělení se určuje pomocí heuristických metod, konkrétně pomocí genetických algoritmů, kde celá populace aproximuje hledané rozdělení. První kapitoly popisují obecně matematické a stochastické programování a dále jsou popsány různé heuristické metody a s důrazem na genetické algoritmy. Těžiště práce je v naprogramování daného algoritmu a otestování na úlohách lineárních a kvadratických stochastických modelů.
APA, Harvard, Vancouver, ISO, and other styles
3

Mendoza, Douglas M. "Generalized approach to minimal uncertainty products." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/83805.

Full text
Abstract:
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (page 35).
A general technique to construct quantum states that saturate uncertainty products using variational methods is developed. Such a method allows one to numerically compute uncertainties in cases where the Robertson-Schrodinger (RS) uncertainty approach fails. To demonstrate the limitations of the RS approach, the ([Delta]x2 )([Delta]p) relation is examined using both the variational and direct method.
by Douglas M. Mendoza.
S.B.
APA, Harvard, Vancouver, ISO, and other styles
4

Löfberg, Johan. "Minimax Approaches to Robust Model Predictive Control." Doctoral thesis, Linköpings universitet, Reglerteknik, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98168.

Full text
Abstract:
Controlling a system with control and state constraints is one of the most important problems in control theory, but also one of the most challenging. Another important but just as demanding topic is robustness against uncertainties in a controlled system. One of the most successful approaches, both in theory and practice, to control constrained systems is model predictive control (MPC). The basic idea in MPC is to repeatedly solve optimization problems on-line to find an optimal input to the controlled system. In recent years, much effort has been spent to incorporate the robustness problem into this framework. The main part of the thesis revolves around minimax formulations of MPC for uncertain constrained linear discrete-time systems. A minimax strategy in MPC means that worst-case performance with respect to uncertainties is optimized. Unfortunately, many minimax MPC formulations yield intractable optimization problems with exponential complexity. Minimax algorithms for a number of uncertainty models are derived in the thesis. These include systems with bounded external additive disturbances, systems with uncertain gain, and systems described with linear fractional transformations. The central theme in the different algorithms is semidefinite relaxations. This means that the minimax problems are written as uncertain semidefinite programs, and then conservatively approximated using robust optimization theory. The result is an optimization problem with polynomial complexity. The use of semidefinite relaxations enables a framework that allows extensions of the basic algorithms, such as joint minimax control and estimation, and approx- imation of closed-loop minimax MPC using a convex programming framework. Additional topics include development of an efficient optimization algorithm to solve the resulting semidefinite programs and connections between deterministic minimax MPC and stochastic risk-sensitive control. The remaining part of the thesis is devoted to stability issues in MPC for continuous-time nonlinear unconstrained systems. While stability of MPC for un-constrained linear systems essentially is solved with the linear quadratic controller, no such simple solution exists in the nonlinear case. It is shown how tools from modern nonlinear control theory can be used to synthesize finite horizon MPC controllers with guaranteed stability, and more importantly, how some of the tech- nical assumptions in the literature can be dispensed with by using a slightly more complex controller.
APA, Harvard, Vancouver, ISO, and other styles
5

Cavanaugh, Kevin J. "A multilevel approach to minimal cost network flows." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/23972.

Full text
Abstract:
This thesis presents an exploration of the application of multigrid/multilevel techniques to a non-geometriclongtransportationproblem. Anintroductiontomultigrid is given, and specifics of how it is applied to this minimum cost network flow problem are explored. This research shows that multilevel techniques can be applied to network optimization problems. Further, since a previous restriction is removed by transferring the problem from a physical space to a cost space, the techniques can be applied to a broader range of problems. Both a multilevel V-cycle and a Full Multigrid (FMG) algorithm are implemented. Various strategies for restriction and local relaxation are discussed, and comparisons between the methods are made. Experimental results are given. Directions for future work include investigation of graph theoretic aspects of the problem, implementation of a regular grid overlay of the domain, exploration of a fast adaptive composite (FAC) grid algorithm, and development of a full approximation scheme (FAS) algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Ferrara, Silvia. "An interdisciplinary approach to the Cypro-Minoan script." Thesis, University College London (University of London), 2006. http://discovery.ucl.ac.uk/1446435/.

Full text
Abstract:
The decipherment of Linear B in 1952 raised the possibility for further decipherments among the Aegean scripts. This unrealised prospect has coloured studies hitherto published on the Cypro-Minoan script with the result that there has been no large-scale systematic study that has employed a pragmatic and exhaustive perspective with a view to establishing a corpus and a critical re-assessment of the applicability of a decipherment method. This thesis aims at filling such a lacuna and responds to the need for a systematic analysis of the script through a corpus of all the inscriptions, here in Volume II (Catalogue) and a full analysis, in Volume I (Text), of the script from historical, archaeological, epigraphic and palaeographical perspectives. The historical conditions for the birth of literacy in Cyprus at the beginning of the Late Bronze Age are investigated in Chapter I, and are founded on a model that considers the material aspect of writing (script as part of the archaeological record, the extent of literacy, the geographical distribution of the inscriptions, the geo-political configuration of Cyprus, the concept of complexity), the functionality of the script (ideological and/or utilitarian applications), and also the symbolic aspect, linked to the realm of status representation and to the relationships between the various socio-political institutions involved in the creation of writing. From an interpretative perspective, the appearance of the script is examined in its symbolic manifestations, politically motivated and hierarchically marked within the manipulation of ideological significata. Following from the analysis of the distribution of the inscriptions, the archaeological investigation in Chapter 2 aims at establishing the relationship between Enkomi---which yielded the great majority of the inscriptions---and the other urban centres, in Cyprus and beyond, in which Cypro-Minoan was discovered. The script is considered in its different strategic significances, marked by a high level of regionalism within the power dynamics of the complex societies of Late Bronze Age Cyprus. Despite the uneven (or altogether absent) information offered by the extant publications as to the contextual associations and strata of many inscribed objects, a survey of how the script was used in each centre is proposed as well as a tentative interpretation of the function of the enigmatic clay bottles. The current classification of the inscriptions into three separate subgroups, CM1, CM2, CM3 (each allegedly hiding a different language), is critiqued in Chapter 3 and its invalidity is established through a review of its divisive, contradictory principles. The inscriptions are thus analysed from a new epigraphic dimension: the extent of ductus variation is seen in its close relationship to the wide range of typological classes of inscribed objects, and the scribal practices are analysed through a detailed study of all inscriptions that encompasses variability of reading direction, opisthography, pleurography, sematography, and metrology. In this respect, the role played by the Near Eastern writing traditions is assessed. Chapter 4 is dedicated to the palaeography of the script. The contributions to the study of this discipline with regard to Cypro-Minoan are appraised. The signary requires a formal rationalisation. The tripartite division has led to a fragmentary view of the script, and the present high level of palaeographical variation of the signs must be re-evaluated. The Cypro-Minoan syllabary as it stands, must be reduced if it is not to be disassociated from its Aegean lineage in which an open syllable configuration is prominent. Through a statistical frequency assessment of each discrete sign in its relative word-position (initial, medial and final) corroborated by the analysis of the significant sequences in which the sign is attested, possible assimilations of isographs with similar word-distributions are suggested. The palaeographical study further dissolves the tripartite classification and achieves a cohesive appreciation of the script.
APA, Harvard, Vancouver, ISO, and other styles
7

Löfberg, Johan. "Minimax approaches to robust model predictive control / Johan Löfberg." Linköping : Univ, 2003. http://www.bibl.liu.se/liupubl/disp/disp2003/tek812s.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Na, Byungsoo. "Heurisic approaches for no-depot k-traveling salesmen problem with a minmax objective." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5825.

Full text
Abstract:
This thesis deals with the no-depot minmax Multiple Traveling Salesmen Problem (MTSP), which can be formulated as follows. Given a set of n cities and k salesmen,find k disjoint tours (one for each salesmen) such that each city belongs to exactly one tour and the length of the longest of k tours is minimized. The no-depot assumption means that the salesmen do not start from and return to one fixed depot. The no-depot model can be applied in designing patrolling routes, as well as in business situations, especially where salesmen work from home or the company has no central office. This model can be also applied to the job scheduling problem with n jobs and k identical machines. Despite its potential applicability to a number of important situations, the research literature on the no-depot minmax k-TSP has been limited, with no reports on computational experiments. The previously published results included the proof of NP-hardness of the problem of interest, which motivates using heuristics for its solution. This thesis proposes several construction heuristic algorithms, including greedy algorithms, cluster first and route second algorithms, and route first and cluster second algorithms. As a local search method for a single tour, 2-opt search and Lin-Kernighan were used, and for a local search method between multiple tours, relocation and exchange (edge heuristics) were used. Furthermore, to prevent the drawback of trapping in the local minima, the simulated annealing method is used. Extensive computational experiments were carried out using TSPLIB instances. Among construction algorithms, route first and cluster second algorithms including removing two edges method performed best. In terms of running time, clustering first and routing second algorithms took shorter time on large-scale instances. The simulated annealing could produce better solutions than the descent method, but did not always perform well in terms of average solution. To evaluate the performance of the proposed heuristic methods, their solutions were compared with the optimal solutions obtained using a mixed-integer programming formulation of the problem. For small-scale problems, heuristic solutions were equal to the optimal solution output by CPLEX.
APA, Harvard, Vancouver, ISO, and other styles
9

Brueni, Dennis J. "Minimal PMU placement for graph observability : a decomposition approach /." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-10312009-020314/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Iwamura, Rafael Santos. "Minimax approach applied to topology optimization of structures subjected to multiple load cases." Instituto Tecnológico de Aeronáutica, 2013. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2834.

Full text
Abstract:
This work investigates a topology optimization strategy for structures under multiple load cases. Typically compliance is calculated for each of the load cases in analysis and minimization is computed for a weighted average of the compliances, resulting in time consuming algorithms. A way to increase convergence speed is updating density on the element level. Instead of having an averaged compliance for the whole structure, it is proposed to compute it individually for every element. All load cases are analyzed, however only the ones of the maximum compliances are considered for sensitivity analysis. Thus compliance gradient is function of a few load cases at each element, reducing the processing time without significant weight penalty. The efficiency of the proposed technique is exemplified and compared to the one of a classical approach of multiple load case problem, solved using optimality criteria.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Minmax approach"

1

Kasperski, Adam. Discrete optimization with interval data: Minmax regret and fuzzy approach. Berlin: Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kasperski, Adam. Discrete optimization with interval data: Minmax regret and fuzzy approach. Berlin: Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kasperski, Adam. Discrete optimization with interval data: Minmax regret and fuzzy approach. Berlin: Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maximum and minimum principles: A unified approach, with applications. Cambridge: Cambridge University Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pierre, Bernhard, ed. H [infinity symbol]-optimal control and related minimax design problems: A dynamic game approach. 2nd ed. Boston: Birkhäuser, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pierre, Bernhard, ed. H [infinity symbol]-optimal control and related minimax design problems: A dynamic game approach. Boston: Birkhäuser, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kasperski, Adam. Discrete Optimization with Interval Data: Minmax Regret and Fuzzy Approach. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

H Infinity Symboloptimal Control And Related Minimax Design Problems A Dynamic Game Approach. Birkhauser, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sewell, M. J. Maximum and Minimum Principles: A Unified Approach with Applications (Cambridge Texts in Applied Mathematics). Cambridge University Press, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sewell, M. J. Maximum and Minimum Principles: A Unified Approach with Applications (Cambridge Texts in Applied Mathematics). Cambridge University Press, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Minmax approach"

1

Berry, Donald A., and Bert Fristedt. "Minimax Approach." In Bandit problems, 191–206. Dordrecht: Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-015-3711-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hutchins, Tiffany, Giacomo Vivanti, Natasa Mateljevic, Roger J. Jou, Frederick Shic, Lauren Cornew, Timothy P. L. Roberts, et al. "Minimal Speech Approach." In Encyclopedia of Autism Spectrum Disorders, 1867. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-1698-3_797.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Macy, Kelly. "Minimal Speech Approach." In Encyclopedia of Autism Spectrum Disorders, 2917–18. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-319-91280-6_797.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Platen, Eckhard, and David Heath. "Minimal Market Model." In A Benchmark Approach to Quantitative Finance, 483–511. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-47856-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Walter, É., and H. Piet-Lahanier. "Recursive Robust Minimax Estimation." In Bounding Approaches to System Identification, 183–97. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-9545-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goldenberg, D. M. "Immunological Approaches for Early Cancer Detection." In Minimal Neoplasia, 104–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-83245-1_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Snygg, John. "*Minimal Surfaces." In A New Approach to Differential Geometry using Clifford's Geometric Algebra, 375–94. Boston, MA: Birkhäuser Boston, 2011. http://dx.doi.org/10.1007/978-0-8176-8283-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cheung, Yiu-ming. "Expectation-MiniMax Approach to Clustering Analysis." In Artificial Neural Networks and Neural Information Processing — ICANN/ICONIP 2003, 165–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44989-2_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mavelli, Fabio. "Theoretical Approaches to Ribocell Modeling." In The Minimal Cell, 255–73. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-90-481-9944-0_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kochs, Hans-Dieter. "Markov minimal cut (MMC) approach." In System Dependability Evaluation Including S-dependency and Uncertainty, 203–82. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64991-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Minmax approach"

1

Mogaadi, Hayet, and Besma Fayech Chaar. "Grasp Approach to RCPSP with MinMax Robustness Objective." In Sixth International Conference on Computer Science, Engineering and Applications. Academy & Industry Research Collaboration Center (AIRCC), 2016. http://dx.doi.org/10.5121/csit.2016.60212.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kaur, Kanwarpreet, and Amardeep Kaur. "A hybrid approach of load balancing through VMs using ACO, MinMax and genetic algorithm." In 2016 2nd International Conference on Next Generation Computing Technologies (NGCT). IEEE, 2016. http://dx.doi.org/10.1109/ngct.2016.7877486.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dey, Sayak, Swagatam Das, and Rammohan Mallipeddi. "The Sparse MinMax k-Means Algorithm for High-Dimensional Clustering." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/291.

Full text
Abstract:
Classical clustering methods usually face tough challenges when we have a larger set of features compared to the number of items to be partitioned. We propose a Sparse MinMax k-Means Clustering approach by reformulating the objective of the MinMax k-Means algorithm (a variation of classical k-Means that minimizes the maximum intra-cluster variance instead of the sum of intra-cluster variances), into a new weighted between-cluster sum of squares (BCSS) form. We impose sparse regularization on these weights to make it suitable for high-dimensional clustering. We seek to use the advantages of the MinMax k-Means algorithm in the high-dimensional space to generate good quality clusters. The efficacy of the proposal is showcased through comparison against a few representative clustering methods over several real world datasets.
APA, Harvard, Vancouver, ISO, and other styles
4

Ammer, Sawsan Mohammed Ezzat Ibrahim. "Minimal Units in the Cinematographic Language." In 8th International Conference on Modern Approach in Humanities. Acavent, 2020. http://dx.doi.org/10.33422/8th.mah.2020.02.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Byun, Jungsub, Almir Mutapcic, Seung-Jean Kim, and John M. Cioffi. "A Minimax Regret Approach to Robust Beamforming." In 2009 IEEE Vehicular Technology Conference (VTC 2009-Fall). IEEE, 2009. http://dx.doi.org/10.1109/vetecf.2009.5378979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lung, Rodica Ioana, and D. Dumitrescu. "A new evolutionary approach to minimax problems." In 2011 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2011. http://dx.doi.org/10.1109/cec.2011.5949847.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pesquet, J., and Y. Eldar. "A minimax approach for mean square denoising." In 2005 Microwave Electronics: Measurements, Identification, Applications. IEEE, 2005. http://dx.doi.org/10.1109/ssp.2005.1628700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Krishnan, R., S. Jagannathan, and V. A. Samaranayake. "A Minimax Approach for Classification with Big-data." In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 2018. http://dx.doi.org/10.1109/bigdata.2018.8622564.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rezaei, F., and C. D. Charalambous. "Robust coding for uncertain sources: a minimax approach." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523602.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pytlak, R. "Strong variation algorithm for minimax control: parallel approach." In 29th IEEE Conference on Decision and Control. IEEE, 1990. http://dx.doi.org/10.1109/cdc.1990.204068.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Minmax approach"

1

Sabogal-Cardona, Orlando, Lynn Scholl, Daniel Oviedo, Amado Crotte, and Felipe Bedoya. Not My Usual Trip: Ride-hailing Characterization in Mexico City. Inter-American Development Bank, August 2021. http://dx.doi.org/10.18235/0003516.

Full text
Abstract:
With a few exceptions, research on ride-hailing has focused on North American cities. Previous studies have identified the characteristics and preferences of ride-hailing adopters in a handful of cities. However, given their marked geographical focus, the relevance and applicability of such work to the practice of transport planning and regulation in cities in the Global South is minimal. In developing cities, the entrance of new transport services follows very different trajectories to those in North America and Europe, facing additional social, economic, and cultural challenges, and involving different strategies. Moreover, the determinants of mode choice might be mediated by social issues such as the perception of crime and the risk of sexual harassment in public transportation, which is often experienced by women in large cities such as Mexico. This paper examines ride-hailing in the Metropolitan Area of Mexico City, unpacking the characteristics of its users, the ways they differ from users of other transport modes, and the implications for urban mobility. Building on the household travel survey from 2017, our analytical approach is based on a set of categorical models. Findings suggest that gender, age, education, and being more mobile are determinants of ride-hailing adoption. The analysis shows that ride-hailing is used for occasional trips, and it is usually done for leisure and health trips as well as for night trips. The study also reflects on ride-hailings implications for the way women access the city.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Minmax approach' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography