Relevant bibliographies by topics / Domination problem

Contents

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

Academic literature on the topic 'Domination problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 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 'Domination problem.'

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 "Domination problem"

1

Sandven, Hallvard. "Systemic domination, social institutions and the coalition problem." Politics, Philosophy & Economics 19, no. 4 (2020): 382–402. http://dx.doi.org/10.1177/1470594x20927927.

Full text
Abstract:
This article argues for a systemic conception of freedom as non-domination. It does so by engaging with the debate on the so-called coalition problem. The coalition problem arises because non-domination holds that groups can be agents of (dominating) power, while also insisting that freedom be robust. Consequently, it seems to entail that everyone is in a constant state of domination at the hands of potential groups. However, the problem can be dissolved by rejecting a ‘strict possibility’ standard for interpreting non-domination’s robustness requirement. Frank Lovett and Philip Pettit propose
APA, Harvard, Vancouver, ISO, and other styles
2

Kao, Mong-Jen, Chung-Shou Liao, and D. T. Lee. "Capacitated Domination Problem." Algorithmica 60, no. 2 (2009): 274–300. http://dx.doi.org/10.1007/s00453-009-9336-x.

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

Klostermeyer, William F., Margaret Ellen Messinger, and Anders Yeo. "Dominating vertex covers: the vertex-edge domination problem." Discussiones Mathematicae Graph Theory 41, no. 1 (2021): 123. http://dx.doi.org/10.7151/dmgt.2175.

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

Vaidya, S. K., and R. M. Pandit. "Some New Perspectives on Global Domination in Graphs." ISRN Combinatorics 2013 (August 20, 2013): 1–4. http://dx.doi.org/10.1155/2013/201654.

Full text
Abstract:
A dominating set is called a global dominating set if it is a dominating set of a graph G and its complement G¯. Here we explore the possibility to relate the domination number of graph G and the global domination number of the larger graph obtained from G by means of various graph operations. In this paper we consider the following problem: Does the global domination number remain invariant under any graph operations? We present an affirmative answer to this problem and establish several results.
APA, Harvard, Vancouver, ISO, and other styles
5

Chang, Gerard J., and Shiow-Fen Hwang. "The edge domination problem." Discussiones Mathematicae Graph Theory 15, no. 1 (1995): 51. http://dx.doi.org/10.7151/dmgt.1006.

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

Klostermeyer, William F. "A Dynamic Domination Problem." Journal of Discrete Mathematical Sciences and Cryptography 18, no. 6 (2015): 837–48. http://dx.doi.org/10.1080/09720529.2015.1026457.

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

Panda, B. S., and D. Pradhan. "A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs." Discrete Mathematics, Algorithms and Applications 07, no. 02 (2015): 1550020. http://dx.doi.org/10.1142/s1793830915500202.

Full text
Abstract:
A set D ⊆ V is a restrained dominating set of a graph G = (V, E) if every vertex in V\D is adjacent to a vertex in D and a vertex in V\D. Given a graph G and a positive integer k, the restrained domination problem is to check whether G has a restrained dominating set of size at most k. The restrained domination problem is known to be NP-complete even for chordal graphs. In this paper, we propose a linear time algorithm to compute a minimum restrained dominating set of a proper interval graph. We present a polynomial time reduction that proves the NP-completeness of the restrained domination pr
APA, Harvard, Vancouver, ISO, and other styles
8

Meybodi, M. Alambardar, M. R. Hooshmandasl, P. Sharifani, and A. Shakiba. "Domination cover number of graphs." Discrete Mathematics, Algorithms and Applications 11, no. 02 (2019): 1950020. http://dx.doi.org/10.1142/s1793830919500204.

Full text
Abstract:
A set [Formula: see text] for the graph [Formula: see text] is called a dominating set if any vertex [Formula: see text] has at least one neighbor in [Formula: see text]. Fomin et al. [Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Transactions on Algorithms (TALG) 5(1) (2008) 9] gave an algorithm for enumerating all minimal dominating sets with [Formula: see text] vertices in [Formula: see text] time. It is known that the number of minimal dominating sets for interval graphs and trees on [Formula: see text] vertices is at most [Formula: se
APA, Harvard, Vancouver, ISO, and other styles
9

Das, Sayani, and Sounaka Mishra. "Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes." Discrete Mathematics, Algorithms and Applications 12, no. 06 (2020): 2050086. http://dx.doi.org/10.1142/s179383092050086x.

Full text
Abstract:
A [Formula: see text] vertex coloring of a graph [Formula: see text] partitions the vertex set into [Formula: see text] color classes (or independent sets). In minimum vertex coloring problem, the aim is to minimize the number of colors used in a given graph. Here, we consider three variations of vertex coloring problem in which (i) each vertex in [Formula: see text] dominates a color class, (ii) each color class is dominated by a vertex and (iii) each vertex is dominating a color class and each color class is dominated by a vertex. These minimization problems are known as Min-Dominator-Colori
APA, Harvard, Vancouver, ISO, and other styles
10

Qiang, Xiaoli, Maryam Akhoundi, Zheng Kou, Xinyue Liu, and Saeed Kosari. "Novel Concepts of Domination in Vague Graphs with Application in Medicine." Mathematical Problems in Engineering 2021 (June 24, 2021): 1–10. http://dx.doi.org/10.1155/2021/6121454.

Full text
Abstract:
VG can manage the uncertainty relevant to the inconsistent and indeterminate information of all real-world problems, in which FGs possibly will not succeed in bringing about satisfactory results. The previous definitions’ restrictions in FGs have made us present new definitions in VGs. A wide range of applications have been attributed to the domination in graph theory for several fields such as facility location problem, school bus routing, modeling biological networks, and coding theory. Therefore, in this research, we study several concepts of domination, such as restrained dominating set (R
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Domination problem"

1

Bramel, Michael H. "Patterns of cooperation, conflict, and domination in children's collaborative problem-solving." FIU Digital Commons, 1987. http://digitalcommons.fiu.edu/etd/1744.

Full text
Abstract:
This study examined the influence of age, expertise, and task difficulty on children's patterns of collaboration. Six- and eight-year-old children were individually pretested for ability to copy a Lego model and then paired with each other and asked to copy two more models. The design was a 3 (dyad skill level: novice, expert, or mixed) X 2 (age: six or eight) X 2 (task difficulty: moderate or complex) factorial. Results indicated that cooperation increased with age and expertise and decreased with task difficulty. However, expertise had a greater influence on younger than older children's int
APA, Harvard, Vancouver, ISO, and other styles
2

Beggas, Fairouz. "Decomposition and Domination of Some Graphs." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1051.

Full text
Abstract:
La théorie des graphes est considérée comme un vaste champ qui permet d'explorer différentes techniques de preuve des mathématiques discrètes. Ainsi, les différents problèmes traités dans cette théorie ont plein d'applications dans d'autres domaines scientifiques tels que l'informatique, la physique, la sociologie, la théorie des jeux, etc. Dans cette optique, nous proposons, dans cette thèse, de mettre l'accent sur trois problèmes de graphes, à savoir la multidécomposition de multigraphes, la [1, 2]-domination et le monitoring des arêtes. Ainsi, le fait d'explorer, dans ce travail de thèse, t
APA, Harvard, Vancouver, ISO, and other styles
3

Koller, Angela Erika. "The frequency assignment problem." Thesis, Brunel University, 2004. http://bura.brunel.ac.uk/handle/2438/4967.

Full text
Abstract:
This thesis examines a wide collection of frequency assignment problems. One of the largest topics in this thesis is that of L(2,1)-labellings of outerplanar graphs. The main result in this topic is the fact that there exists a polynomial time algorithm to determine the minimum L(2,1)-span for an outerplanar graph. This result generalises the analogous result for trees, solves a stated open problem and complements the fact that the problem is NP-complete for planar graphs. We furthermore give best possible bounds on the minimum L(2,1)-span and the cyclic-L(2,1)-span in outerplanar graphs, when
APA, Harvard, Vancouver, ISO, and other styles
4

Stevenson, David John. "Understanding the problem of cultural non-participation : discursive structures, articulatory practice and cultural domination." Thesis, Queen Margaret University, 2016. https://eresearch.qmu.ac.uk/handle/20.500.12289/7339.

Full text
Abstract:
This thesis employs a discursive methodology to analyse the policy problem of cultural non-participation. In so doing it seeks to answer the questions of what the problem is, why a problem exists, and what the existence of the problem does ‘in the real’ (Bacchi, 2009). The study draws on primary data generated in the form of policy texts, speeches and 42 in-depth qualitative interviews with individuals working in or for publicly funded cultural organisations in Scotland. Employing the methodological approach of problematisation (Foucault, 2003a [1981]), the study offers a close analysis of the
APA, Harvard, Vancouver, ISO, and other styles
5

Talon, Alexandre. "Intensive use of computing resources for dominations in grids and other combinatorial problems." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEN079.

Full text
Abstract:
Nous cherchons à prouver de nouveaux résultats en théorie des graphes et combinatoire grâce à la vitesse de calcul des ordinateurs, couplée à des algorithmes astucieux. Nous traitons quatre problèmes. Le théorème des quatre couleurs affirme que toute carte d’un monde où les pays sont connexes peut être coloriée avec 4 couleurs sans que deux pays voisins aient la même couleur. Il a été le premier résultat prouvé en utilisant l'ordinateur, en 1989. Nous souhaitions automatiser encore plus cette preuve. Nous expliquons la preuve et fournissons un programme qui permet de la réétablir, ainsi que d'
APA, Harvard, Vancouver, ISO, and other styles
6

Harutyunyan, Ararat. "Probabilistic methods and domination related problems in graphs." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=116070.

Full text
Abstract:
A dominating set in a graph is a set S of vertices such that every vertex not in S is adjacent to a member S. A global defensive alliance in a graph is a dominating set S with the property that every vertex in S has in its closed neighborhood at least as many vertices in S as in V -- S. A global offensive alliance in a graph is a dominating set S with the property that every vertex in V -- S has in its closed neighborhood at least as many vertices in S as in V -- S.<br>We first study alliances in graphs. There are many results in this area. For example, it is known that every connected n-verte
APA, Harvard, Vancouver, ISO, and other styles
7

ALBUQUERQUE, MAYRA CARVALHO. "MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Esta tese faz um estudo do problema do Conjunto Dominante, um problema NP-difícil de grande relevância em aplicações relacionadas ao projeto de rede sem fio, mineração de dados, teoria de códigos, dentre outras. O conjunto dominante mínimo em um grafo é um conjunto mínimo de vértices de modo que cada vértice do grafo pertence a este conjunto ou é adjacente a um vértice que pertence a ele. Três variantes do problema foram estudadas; primeiro, uma variante na qual considera peso
APA, Harvard, Vancouver, ISO, and other styles
8

Ma, Ka Leung. "In solving the dominating set problem : group theory approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0005/NQ40311.pdf.

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

Gründlingh, Werner R. "Two new combinatorial problems involving dominating sets for lottery schemes /." Link to the online version, 2004. http://hdl.handle.net/10019.1/1388.

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

Grundlingh, Werner R. "Two new combinatorial problems involving dominating sets for lottery schemes." Thesis, Stellenbosch : University of Stellenbosch, 2004. http://hdl.handle.net/10019.1/1388.

Full text
Abstract:
Thesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004.<br>Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered n-subsets from the same universal set prior to a winning draw, and is awarded a prize if ...
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Domination problem"

1

Agon culture: Competition, conflict and the problem of domination. de Sitter Publications, 2011.

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

The bonds of love: Psychoanalysis, feminism, and the problem of domination. Pantheon Books, 1988.

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

Benjamin, Jessica. The bonds of love: Psychoanalysis, feminism and the problem of domination. Virago Press, 1990.

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

Ward, Audrey. Gender and domination: The problem of patriarchal power in the narratives of Alice Walker, Alice Munro, Gloria Naylor, and Toni Morrison. Watermark Press, 1990.

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

Clarke, Bruce. Dominations. Homnisphères, 2006.

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

Zylberberg, Jacques. Domination théocratique, dissonances ecclésiales et dissipation démocratique. Université Laval], 1995.

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

Du, Ding-Zhu. Connected Dominating Set: Theory and Applications. Springer New York, 2013.

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

The bonds of love: Psychoanalysis, feminism, and the problem of domination. Pantheon books, 1988.

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

Gray, Barbara, and Jill Purdy. How Partnerships Can Transform Institutional Fields. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198782841.003.0011.

Full text
Abstract:
In this final chapter, our focus is on assessing the impact of MSIs on institutional fields. A table of impacts is introduced based on the level of shared responsibility that partners assume and the scope of the problem addressed. Impacts can also be assessed by examining changes in the level or type of institutionalization within the field. Three dimensions are proposed to make this assessment: changes in levels of signification (meaning), legitimation (routines, practices, and rules) and domination (power) within the field. Building on this, four distinct configurations of field level condit
APA, Harvard, Vancouver, ISO, and other styles
10

Douglas W, Arner, Hsu Berry FC, Goo Say H, Johnstone Syren, Lejot Paul, and Tse Maurice Kwong-Sang. Part IV Financial Market Conduct and Misconduct, 10 Corporate Governance. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198706472.003.0010.

Full text
Abstract:
This chapter addresses corporate governance in Hong Kong. The chapter reviews the ways in which a company’s management is regulated in Hong Kong at common law and equity, by statutory legislation, by the company’s constitutional document (the articles), and by regulatory rules. Such a framework addresses issues such as board structure and operation, the personal interests of directors, dealings between the company and directors, limiting the power of directors, disclosure of information, and the question of when shareholders should be involved in decisions of the board. The chapter shows that
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Domination problem"

1

Liao, Chung-Shou, and Der-Tsai Lee. "Power Domination Problem in Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11533719_83.

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

Zamora, Justo Serrano. "Democracy and the Problem of Domination." In John Dewey’s Ethical Theory. Routledge, 2020. http://dx.doi.org/10.4324/9780429259869-11.

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

Kao, Mong-Jen, and Han-Lin Chen. "Approximation Algorithms for the Capacitated Domination Problem." In Frontiers in Algorithmics. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14553-7_19.

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

Lin, Ching-Chi, Keng-Chu Ku, Gen-Huey Chen, and Chan-Hung Hsu. "Paired-Domination Problem on Distance Hereditary Graphs." In Communications in Computer and Information Science. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9190-3_54.

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

Brandstädt, A. "On the Domination Problem for Bipartite Graphs." In Topics in Combinatorics and Graph Theory. Physica-Verlag HD, 1990. http://dx.doi.org/10.1007/978-3-642-46908-4_17.

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

Cheng, ChangJie, Changhong Lu, and Yu Zhou. "The k-power Domination Problem in Weighted Trees." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04618-7_13.

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

Shang, Weiping, and Xiaodong Hu. "The Roman Domination Problem in Unit Disk Graphs." In Computational Science – ICCS 2007. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72588-6_51.

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

Bryant, Peter T. "Problem-Solving." In Augmented Humanity. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-76445-6_4.

Full text
Abstract:
AbstractHuman and artificial agents are both intelligent problem solvers. Therefore, problem-solving will be central to their collaboration. Among notable developments in this domain is the capability for artificial agents to sample and search in a very farsighted fashion, or to be hyperopic, which is the technical term for farsighted vision, the opposite of myopia. This inverts the dominant concern of prior theory, which focuses on limited, bounded capabilities in problem-solving and decision-making. This shift poses significant opportunities and risks for augmented agents. Human processing will likely remain naturally myopic and limited, while artificial processing is increasingly hyperopic and powerful. Given these differences, digitally augmented problem-solving could be extremely divergent and dysfunctional, for example, by sampling and searching in a hyperopic fashion, while guided by persistent human myopia. Alternatively, one agent might dominate the other, leading to extreme convergence and possibly the digital domination of problem-solving.
APA, Harvard, Vancouver, ISO, and other styles
9

Hadley, Scott. "Domination & separation applied to the quadratic assignment problem." In DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1994. http://dx.doi.org/10.1090/dimacs/016/09.

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

Zheng, Ying, Jianxin Wang, and Qilong Feng. "Kernelization and Lower Bounds of the Signed Domination Problem." In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38756-2_27.

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

Conference papers on the topic "Domination problem"

1

Komarov, V. M., A. А. Samchenko, and M. S. Kondratiev. "A/T tracts domination problem in the human genome." In Mathematical Biology and Bioinformatics. IMPB RAS - Branch of KIAM RAS, 2018. http://dx.doi.org/10.17537/icmbb18.114.

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

Ji, Xinhua, Yangin Wang, Jun Li, and Yuwen Qin. "Stress analysis for the contact problem by frequency domination isodyne method." In Optical Technology and Image Processing fo rFluids and solids Diagnostics 2002, edited by Gong Xin Shen, Soyoung S. Cha, Fu-Pen Chiang, and Carolyn R. Mercer. SPIE, 2003. http://dx.doi.org/10.1117/12.509877.

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

Yang, Si-Han, and Hung-Lung Wang. "A Note on the 2-Tuple Total Domination Problem in Harary Graphs." In 2016 International Computer Symposium (ICS). IEEE, 2016. http://dx.doi.org/10.1109/ics.2016.0022.

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

Corominas, Guillem Rodríguez, Christian Blum, and Maria J. Blesa. "A biased random key genetic algorithm for the weighted independent domination problem." In GECCO '19: Genetic and Evolutionary Computation Conference. ACM, 2019. http://dx.doi.org/10.1145/3319619.3326901.

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

Xu, Chao, Wenjun Li, Yongjie Yang, Jianer Chen, and Jianxin Wang. "Resolution and Domination: An Improved Exact MaxSAT Algorithm." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/166.

Full text
Abstract:
We study the Maximum Satisfiability problem (MaxSAT). Particularly, we derive a branching algorithm of running time O*(1.2989^m) for the MaxSAT problem, where m denotes the number of clauses in the given CNF formula. Our algorithm considerably improves the previous best result O*(1.3248^m) by Chen and Kanj [2004] published 15 years ago. For our purpose, we derive improved branching strategies for variables of degrees 3, 4, and 5. The worst case of our branching algorithm is at variables of degree 4 which occur twice both positively and negatively in the given CNF formula. To serve the branchin
APA, Harvard, Vancouver, ISO, and other styles
6

Mishra, Sumit, and Carlos A. Coello Coello. "An Approach for Non-domination Level Update Problem in Steady-State Evolutionary Algorithms With Parallelism." In 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2019. http://dx.doi.org/10.1109/cec.2019.8790072.

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

Cai, Xinye, and Ou Wei. "A hybrid of decomposition and domination based evolutionary algorithm for multi-objective software next release problem." In 2013 10th IEEE International Conference on Control and Automation (ICCA). IEEE, 2013. http://dx.doi.org/10.1109/icca.2013.6565143.

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

Liu, Bei, Wei Wang, Donghyun Kim, Yingshu Li, and Sung-Sik Kwon. "A Simpler Constant Factor Approximation for the k-Connected m-Domination Set Problem in Unit Disk Graph." In 2016 25th International Conference on Computer Communication and Networks (ICCCN). IEEE, 2016. http://dx.doi.org/10.1109/icccn.2016.7568483.

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

Niu, Ben, Georgi M. Dimirovski, and Jun Zhao. "Tracking Control for Switched Nonlinear Systems Subject to Time-Varying Output Constraints." In ASME 2012 11th Biennial Conference on Engineering Systems Design and Analysis. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/esda2012-82266.

Full text
Abstract:
In this paper, we address the tracking control problem for switched nonlinear systems in strict-feedback form with time-varying output constraints. To prevent the output from violating the time-varying constraints, we employ a Barrier Lyapunov Function, which relies explicitly on time. Based on the simultaneous domination assumption, we design a controller for the switched system, which guarantees that asymptotic tracking is achieved without transgression of the constraints and all closed-loop signals remain bounded under arbitrary switchings. The effectiveness of the proposed results is illus
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Xue, Qi Zou, and Xixia Xu. "Action-Guided Attention Mining and Relation Reasoning Network for Human-Object Interaction Detection." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/154.

Full text
Abstract:
Human-object interaction (HOI) detection is important to understand human-centric scenes and is challenging due to subtle difference between fine-grained actions, and multiple co-occurring interactions. Most approaches tackle the problems by considering the multi-stream information and even introducing extra knowledge, which suffer from a huge combination space and the non-interactive pair domination problem. In this paper, we propose an Action-Guided attention mining and Relation Reasoning (AGRR) network to solve the problems. Relation reasoning on human-object pairs is performed by exploitin
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Domination problem"

1

Incongruity between biological and chronologic age among the pupils of sports schools and the problem of group lessons effectiveness at the initial stage of training in Greco-Roman wrestling. Aleksandr S. Kuznetsov, 2021. http://dx.doi.org/10.14526/2070-4798-2021-16-1-19-23.

Full text
Abstract:
Considerable influence and compulsory dropout among those, who go in for GrecoRoman wrestling at the age of 10-13, does not take into account the level of individual biological development and integral demands domination claimed on too high general physical training (GPT) (4) normatives fulfillment. It corresponds with general situation in the system of education (6, 9). In spite of uneven speed of biological development (1, 8, 9), there are general demands claimed on physical training at school for age groups (5) in accordance with chronologic age. The same situation is at sports schools. Tec
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Domination problem' 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