Relevant bibliographies by topics / Maximum Independent Set problem

Contents

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

Academic literature on the topic 'Maximum Independent Set problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 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 'Maximum Independent Set 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 "Maximum Independent Set problem"

1

Luo, Dong Ling, Chen Yin Wang, Yang Yi, Dong Ling Zhang, and Xiao Cong Zhou. "Fuzzy Maximum Independent Set Problem." Applied Mechanics and Materials 687-691 (November 2014): 1161–65. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.1161.

Full text
Abstract:
Edge covering problem, dominating set problem, and independent set problem are classic problems in graph theory except for vertex covering problem. In this paper, we study the maximum independent set problem under fuzzy uncertainty environments, which aims to search for the independent set with maximum value in a graph. First, credibility theory is introduced to describe the fuzzy variable. Three decision models are performed based on the credibility theory. A hybrid intelligence algorithm which integrates genetic algorithm and fuzzy simulation is proposed due to the unavailability of traditional algorithm. Finally, numerical experiments are performed to prove the efficiency of the fuzzy decision modes and the hybrid intelligence algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Luo, Dong Ling, Chen Yin Wang, Yang Yi, Dong Ling Zhang, and Xiao Cong Zhou. "Fuzzy Maximum Independent Set Problem of Graphic." Applied Mechanics and Materials 687-691 (November 2014): 1657–61. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.1657.

Full text
Abstract:
Edge covering problem, dominating set problem, and independent set problem are classic problems in graph theory except for vertex covering problem. In this paper, we study the maximum independent set problem under fuzzy uncertainty environments, which aims to search for the independent set with maximum value in a graph. First, credibility theory is introduced to describe the fuzzy variable. Three decision models are performed based on the credibility theory. A hybrid intelligence algorithm which integrates genetic algorithm and fuzzy simulation is proposed due to the unavailability of traditional algorithm. Finally, numerical experiments are performed to prove the efficiency of the fuzzy decision modes and the hybrid intelligence algorithm.
APA, Harvard, Vancouver, ISO, and other styles
3

FAN, Yue-Ke, Xiao-Li Qiang, and Jin XU. "Sticker Model for Maximum Clique Problem and Maximum Independent Set." Chinese Journal of Computers 33, no. 2 (April 27, 2010): 305–10. http://dx.doi.org/10.3724/sp.j.1016.2010.00305.

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

Yang, Yan, and Zhi Xiang Yin. "Surface- Based Computing Model of Maximum Independent Set Problem." Advanced Materials Research 328-330 (September 2011): 1729–33. http://dx.doi.org/10.4028/www.scientific.net/amr.328-330.1729.

Full text
Abstract:
About thirty years ago, the concept of the complexity of the problem was proposed. The most important complex class is P and NP class. Fruitful results of this concept are the existence of the so-called complex class complete problem. If the other issues of this class once solved in polynomial time, then the problem must exist polynomial time algorithms. Therefore, the complete problem is most difficult to solve, but because of their presence, we can choose any of them improved algorithm for a problem, so this kind of problem to get a good solution. DNA computing is a novel method that solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. Maximum Independent Set problem (MIS) is a well-known NP-complete problem. Maximum Clique and Minimum Vertex Covering problem is equivalent to Maximum Independent Set problem. In this paper, we explore solving Maximum Independent Set problem by transforming it into equivalent 0-1 programming problem, and utilizing the surface computing model of that. The proposed method demonstrates universal nature of NP-complete problem.
APA, Harvard, Vancouver, ISO, and other styles
5

Saha, Anita, and Madhumangal Pal. "Maximum weightk-independent set problem on permutation graphs." International Journal of Computer Mathematics 80, no. 12 (December 2003): 1477–87. http://dx.doi.org/10.1080/00207160310001614972.

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

Andrade, Diogo V., Mauricio G. C. Resende, and Renato F. Werneck. "Fast local search for the maximum independent set problem." Journal of Heuristics 18, no. 4 (February 25, 2012): 525–47. http://dx.doi.org/10.1007/s10732-012-9196-4.

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

Wang, Yanfeng, Xuewen Bai, Donghui Wei, and Guangzhao Cui. "DNA Self-Assembly for Maximum Weighted Independent Set Problem." Advanced Science Letters 17, no. 1 (October 1, 2012): 21–26. http://dx.doi.org/10.1166/asl.2012.3677.

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

Burns, James E. "The maximum independent set problem for cubic planar graphs." Networks 19, no. 3 (May 1989): 373–78. http://dx.doi.org/10.1002/net.3230190307.

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

Yu, Chang-Wu, and Gen-Huey Chen. "The weighted maximum independent set problem in permutation graphs." BIT 32, no. 4 (December 1992): 609–18. http://dx.doi.org/10.1007/bf01994845.

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

Li, Ruizhi, Yupan Wang, Shuli Hu, Jianhua Jiang, Dantong Ouyang, and Minghao Yin. "Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic." Mathematical Problems in Engineering 2020 (December 16, 2020): 1–11. http://dx.doi.org/10.1155/2020/3050714.

Full text
Abstract:
The set packing problem (SPP) is a significant NP-hard combinatorial optimization problem with extensive applications. In this paper, we encode the set packing problem as the maximum weighted independent set (MWIS) problem and solve the encoded problem with an efficient algorithm designed to the MWIS problem. We compare the independent set-based method with the state-of-the-art algorithms for the set packing problem on the 64 standard benchmark instances. The experimental results show that the independent set-based method is superior to the existing algorithms in terms of the quality of the solutions and running time obtained the solutions.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Maximum Independent Set problem"

1

Lê, Ngoc C. "Algorithms for the Maximum Independent Set Problem." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2015. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-172639.

Full text
Abstract:
This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs.
APA, Harvard, Vancouver, ISO, and other styles
2

Cenek, Eowyn W. "Subtree overlap graphs and the maximum independent set problem." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ28923.pdf.

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

Butenko, Sergiy. "Maximum independent set and related problems, with applications." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0001011.

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

Dabrowski, Konrad K. "Structural solutions to maximum independent set and related problems." Thesis, University of Warwick, 2012. http://wrap.warwick.ac.uk/54515/.

Full text
Abstract:
In this thesis, we study some fundamental problems in algorithmic graph theory. Most natural problems in this area are hard from a computational point of view. However, many applications demand that we do solve such problems, even if they are intractable. There are a number of methods in which we can try to do this: 1) We may use an approximation algorithm if we do not necessarily require the best possible solution to a problem. 2) Heuristics can be applied and work well enough to be useful for many applications. 3) We can construct randomised algorithms for which the probability of failure is very small. 4) We may parameterize the problem in some way which limits its complexity. In other cases, we may also have some information about the structure of the instances of the problem we are trying to solve. If we are lucky, we may and that we can exploit this extra structure to find efficient ways to solve our problem. The question which arises is - How far must we restrict the structure of our graph to be able to solve our problem efficiently? In this thesis we study a number of problems, such as Maximum Indepen- dent Set, Maximum Induced Matching, Stable-II, Efficient Edge Domina- tion, Vertex Colouring and Dynamic Edge-Choosability. We try to solve problems on various hereditary classes of graphs and analyse the complexity of the resulting problem, both from a classical and parameterized point of view.
APA, Harvard, Vancouver, ISO, and other styles
5

Huang, Fuzhuo. "On the maximum weighted independent set problem with applications in wireless sensor networks." Thesis, Boston University, 2013. https://hdl.handle.net/2144/12785.

Full text
Abstract:
Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.
The Maximum Weighted Independent Set (MWIS) Problem considers a graph with weights assigned to the nodes and seeks to discover the "heaviest" independent set, that is, a set of nodes with maximal total weight so that no two nodes in the set are connected by an edge. The MWIS problem arises in many application domains including maximum a posteriori estimation, error-correcting coding, spatial statistics, and communication networks. It has been shown to be combinatorially hard (NP-complete) and there has been extensive work in the literature proposing a variety of heuristics. In this dissertation, we propose a novel, low-complexity and distributed algorithm that yields high-quality feasible solutions to this problem. Our proposed algorithm consists of two phases, each of which requires only local information and is based on message-passing between neighboring nodes. The first phase solves Linear Programming (LP) relaxations of the MWIS problem. We consider two LP relaxations: one involving simple edge constraints and another which is tighter and accounts for all cliques of the graph. The second phase of our algorithm uses the solution of the relaxation and constructs a feasible solution to the MWIS problem. We establish that we always obtain a feasible solution to MWIS and that for special cases of graphs the solution is optimal. More specifically, with the clique-based relaxation we can guarantee an optimal solution for the large class of so called perfect graphs. When using the edge-based relaxation, our algorithm guarantees optimality for bipartite graphs and obtains with high probability near-optimal solutions for general graphs with large weights. We also establish that our algorithms can run in an asynchronous fashion and provide the same optimality guarantees as the synchronous version. We apply our algorithms to two different applications in wireless sensor networks. The first application concerns the problem of efficiently "emptying" a wireless sensor network that has accumulated a large amount of data at its nodes and seeks to relay them to designated gateways so as to maximize a concave function of achievable transmission rates. The other application is the problem of scheduling wireless networks with stochastic packet arrivals on the links and constant transmission rates. In both cases we show that our algorithms lead to significant performance gains over the current state-of-the art.
APA, Harvard, Vancouver, ISO, and other styles
6

Warrier, Deepak. "A branch, price, and cut approach to solving the maximum weighted independent set problem." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5814.

Full text
Abstract:
The maximum weight-independent set problem (MWISP) is one of the most well-known and well-studied NP-hard problems in the field of combinatorial optimization. In the first part of the dissertation, I explore efficient branch-and-price (B&P) approaches to solve MWISP exactly. B&P is a useful integer-programming tool for solving NP-hard optimization problems. Specifically, I look at vertex- and edge-disjoint decompositions of the underlying graph. MWISP’s on the resulting subgraphs are less challenging, on average, to solve. I use the B&P framework to solve MWISP on the original graph G using these specially constructed subproblems to generate columns. I demonstrate that vertex-disjoint partitioning scheme gives an effective approach for relatively sparse graphs. I also show that the edge-disjoint approach is less effective than the vertex-disjoint scheme because the associated DWD reformulation of the latter entails a slow rate of convergence. In the second part of the dissertation, I address convergence properties associated with Dantzig-Wolfe Decomposition (DWD). I discuss prevalent methods for improving the rate of convergence of DWD. I also implement specific methods in application to the edge-disjoint B&P scheme and show that these methods improve the rate of convergence. In the third part of the dissertation, I focus on identifying new cut-generation methods within the B&P framework. Such methods have not been explored in the literature. I present two new methodologies for generating generic cutting planes within the B&P framework. These techniques are not limited to MWISP and can be used in general applications of B&P. The first methodology generates cuts by identifying faces (facets) of subproblem polytopes and lifting associated inequalities; the second methodology computes Lift-and-Project (L&P) cuts within B&P. I successfully demonstrate the feasibility of both approaches and present preliminary computational tests of each.
APA, Harvard, Vancouver, ISO, and other styles
7

Sachdeva, Sandeep. "Development of a branch and price approach involving vertex cloning to solve the maximum weighted independent set problem." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/3251.

Full text
Abstract:
We propose a novel branch-and-price (B&P) approach to solve the maximum weighted independent set problem (MWISP). Our approach uses clones of vertices to create edge-disjoint partitions from vertex-disjoint partitions. We solve the MWISP on sub-problems based on these edge-disjoint partitions using a B&P framework, which coordinates sub-problem solutions by involving an equivalence relationship between a vertex and each of its clones. We present test results for standard instances and randomly generated graphs for comparison. We show analytically and computationally that our approach gives tight bounds and it solves both dense and sparse graphs quite quickly.
APA, Harvard, Vancouver, ISO, and other styles
8

Lê, Ngoc C. [Verfasser], Ingo [Akademischer Betreuer] Schiermeyer, Ingo [Gutachter] Schiermeyer, and Jochen [Gutachter] Harant. "Algorithms for the Maximum Independent Set Problem / Ngoc C. Lê ; Gutachter: Ingo Schiermeyer, Jochen Harant ; Betreuer: Ingo Schiermeyer." Freiberg : Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2015. http://d-nb.info/1220837970/34.

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

Morel, Gregory. "Stabilité et coloration des graphes sans P5." Thesis, Grenoble, 2011. http://www.theses.fr/2011GRENM042/document.

Full text
Abstract:
La classe des graphes sans P5, c'est-à-dire des graphes ne contenant pas de chaîne induite à cinq sommets, est d'un intérêt particulier en théorie des graphes. Il s'agit en effet de la plus petite classe définie par un seul sous-graphe connexe interdit pour laquelle on ignore encore s'il existe un algorithme polynomial permettant de résoudre le problème du stable maximum. Or ce problème, dont on sait qu'il est difficile en général, est d'une grande importance en pratique (problèmes de planification, d'allocation de registres dans un processeur, biologie moléculaire...). Dans cette thèse, nous commençons par dresser un état de l'art complet des méthodes utilisées pour résoudre le problème dans des sous-classes de graphes sans P5, puis nous étudions et résolvons ce problème dans une sous-classe particulière, la classe des graphes sans P5 3-colorables. Nous apportons également des solutions aux problèmes de la reconnaissance et de la coloration de ces graphes, chaque fois en temps linéaire. Enfin, nous définissons, caractérisons et sommes capables de reconnaître les graphes "chain-probe", qui sont les graphes auxquels il est possible de rajouter des arêtes entre certains sommets de sorte qu'ils soient bipartis et sans P5. Les problèmes de ce type proviennent de la génétique et ont également des applications en intelligence artificielle
The class of P5-free graphs, namely the graphs without induced chains with five vertices, is of particular interest in graph theory. Indeed, it is the smallest class defined by only one forbidden connected induced subgraph for which the complexity of the Maximum Independent Set problem is unknown. This problem has many applications in planning, CPU register allocation, molecular biology... In this thesis, we first give a complete state of art of the methods used to solve the problem in P5-free graphs subclasses; then we study and solve this problem in a particular subclass, the class of 3-colorable P5-free graphs. We also bring solutions to recognition and coloring problems of these graphs, each time in linear time. Finally, we define, characterize, and are able to recognize "chain-probe" graphs, namely the graphs for which we can add edges between particular vertices such that the resulting graph is bipartite and P5-free. Problems of this type come from genetics and have application in I.A
APA, Harvard, Vancouver, ISO, and other styles
10

Laboratory, Hirata, Tomio Hirata, Takao Ono, and Xuzhen Xie. "Approximation Algorithms for Weighted Independent Set Problem." INTELLIGENT MEDIA INTEGRATION NAGOYA UNIVERSITY / COE, 2005. http://hdl.handle.net/2237/10363.

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

Books on the topic "Maximum Independent Set problem"

1

Paolo, Giudici. Part II Investment Firms and Investment Services, 6 Independent Financial Advice. Oxford University Press, 2017. http://dx.doi.org/10.1093/law/9780198767671.003.0006.

Full text
Abstract:
The quickest policy indication for increasing households’ trust in financial markets, to the benefit of the economic system, seems to be the offer of professional financial advice on affordable terms. The problem is how to convince investors to pay for advice, and how to protect investors who do not want to pay for advice from conflicted advice and from hard sell under the guise of personal recommendation—an area where MiFID I has not performed well. MiFID II’s answer is to pose a new set of information duties on financial advisors with the clear intention of nudging investors towards independent, fee-only advice. The intention is good. However, the new regime raises many important issues, including the ambiguity of the ‘independent’ suit, the interaction between the product governance regime and the suitability assessment, the regulatory inconsistency that it is emerging between investment advice and portfolio management, and the potential costs of the written statement of suitability.
APA, Harvard, Vancouver, ISO, and other styles
2

Fuller, Richard A., and James E. M. Watson. Replacing underperforming nature reserves. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198808978.003.0023.

Full text
Abstract:
This chapter discusses a radical solution to the problem that many protected areas are not in the right places to achieve maximum conservation benefit. The radical solution involves replacing underperforming protected areas with new ones that achieve more for conservation. Such a system revision was successfully undertaken in Bhutan as long ago as 1993. This chapter argues that designing robust policies and processes around reserve replacement will (i) force a thorough assessment of the role of protected areas against a clear set of conservation objectives, (ii) upgrade a poorly performing system of protected areas into a system that achieves better conservation outcomes for the same, or even a lower, overall budget, and (iii) allow for sober, transparent, and effective decision-making when parts of existing protected areas are under threat from development.
APA, Harvard, Vancouver, ISO, and other styles
3

Mann, Peter. Constrained Lagrangian Mechanics. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198822370.003.0008.

Full text
Abstract:
This chapter builds on the previous two chapters to tackle constrained systems, using Lagrangian mechanics and constrained variations. The first section deals with holonomic constraint equations using Lagrange multipliers; these can be used to reduce the number of coordinates until a linearly independent minimal set is obtained that describes a constraint surface within configuration space, so that Lagrange equations can be set up and solved. Motion is understood to be confined to a constraint submanifold. The variational formulation of non-holonomic constraints is then discussed to derive the vakonomic formulation. These erroneous equations are then compared to the central Lagrange equation, and the precise nature of the variations used in each formulation is investigated. The vakonomic equations are then presented in their Suslov form (Suslov–vakonomic form) in an attempt to reconcile the two approaches. In addition, the structure of biological membranes is framed as a constrained optimisation problem.
APA, Harvard, Vancouver, ISO, and other styles
4

Adams, Karen Ruth. The Causes of War. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190846626.013.323.

Full text
Abstract:
The scientific study of war is a pressing concern for international politics. Given the destructive nature of war, ordinary citizens and policy makers alike are eager to anticipate if not outright avoid outbreaks of violence. Understanding the causes of war can be a complex process. Scholars of international relations must first define war, and then establish a universe of actors or conflicts in which both war and peace are possible. Next, they must collect data on the incidence of war in the entire universe of cases over a particular period of time, a random sample of relevant cases, a number of representative cases, or a set of cases relevant to independent variables in the theories they are testing. Finally, scholars must use this data to construct quantitative and qualitative tests of hypotheses about why actors fight instead of resolving their differences in other ways and, in particular, why actors initiate wars by launching the first attack. Instead of taking the inductive approach of inventorying the causes of particular wars and then attempting to find general rules, it is necessary for scholars to approach the problem deductively, developing theories about the environment in which states operate, deriving hypotheses about the incidence of war and attack, and using quantitative and qualitative methods to test these hypotheses.
APA, Harvard, Vancouver, ISO, and other styles
5

Medalia, Alice, Tiffany Herlands, Alice Saperstein, and Nadine Revheim. Cognitive Remediation for Psychological Disorders. Oxford University Press, 2017. http://dx.doi.org/10.1093/med-psych/9780190608453.001.0001.

Full text
Abstract:
Individuals with serious and persistent mental illnesses, including schizophrenia and affective disorders, often experience cognitive deficits that make it difficult to perform everyday tasks. For example, they may have difficulty with attention, memory, processing speed, and problem solving, and this may interfere with functioning at work, school, and in social situations. Cognitive remediation is an evidence-based behavioral treatment for people who are experiencing cognitive impairments that interfere with role functioning. This edition contains all the information needed to set up a cognitive remediation program so clients can strengthen the cognitive skills needed for everyday functioning. The program described is called Neuropsychological and Educational Approach to Remediation (NEAR), which is an evidence-based approach to cognitive remediation that uses carefully crafted instructional techniques that reflect an understanding of how people learn best. The goals of NEAR are to provide a positive learning experience, to promote independent learning, and to promote optimal cognitive functioning in daily life. This second edition of the popular 2009 therapist’s guide provides step-by-step instructions on how to implement NEAR techniques with patients to improve their cognitive functioning and quality of life. Guidelines are provided for setting up and running a successful cognitive remediation program. Therapists learn how to choose appropriate cognitive exercises, recruit and work with clients, perform intake interviews, and create treatment plans. This guide comes complete with all the tools necessary for facilitating treatment, including program evaluation forms and client handouts.
APA, Harvard, Vancouver, ISO, and other styles
6

Kamtekar, Rachana. Plato's Moral Psychology. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198798446.001.0001.

Full text
Abstract:
Plato’s Moral Psychology is concerned with Plato’s account of the soul insofar as it bears on our living well or badly, virtuously or viciously. The core of Plato’s moral psychology is his account of human motivation, and PMP argues that throughout the dialogues Plato maintains that human beings have a natural desire for our own good, and that actions and conditions contrary to this desire are involuntary (from which follows the ‘Socratic paradox’ that wrongdoing is involuntary). Our natural desire for our own good may be manifested in different ways: by our pursuit of what we calculate is best, but also by our pursuit of pleasant or fine things—pursuits which Plato assigns to distinct parts of the soul, sometimes treating these soul-parts as homuncular sub-agents to facilitate psychic management, and other times providing a natural teleological account for them. Thus PMP develops a very different interpretation of Plato’s moral psychology from the mainstream interpretation, according to which Plato first proposes that human beings only do what we believe to be the best of the things we can do (‘Socratic intellectualism’) and then in the middle dialogues rejects this in favour of the view that the soul is divided into parts with good-dependent and good-independent motivations (‘the divided soul’). PMP arrives at its different interpretation through the methodology of reading dialogues with a close eye to the dialectical dependence of what the main speaker says on the precise intellectual problem set up between himself and his interlocutors.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Maximum Independent Set problem"

1

Demange, Marc, and Vangelis Th Paschos. "Constructive — non-constructive approximation and maximum independent set problem." In Combinatorics and Computer Science, 194–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61576-8_83.

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

Andrade, Diogo V., Mauricio G. C. Resende, and Renato F. Werneck. "Fast Local Search for the Maximum Independent Set Problem." In Experimental Algorithms, 220–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-68552-4_17.

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

Dahlum, Jakob, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck. "Accelerating Local Search for the Maximum Independent Set Problem." In Experimental Algorithms, 118–33. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-38851-9_9.

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

Borowiecki, Piotr, and Frank Göring. "GreedyMAX-type Algorithms for the Maximum Independent Set Problem." In SOFSEM 2011: Theory and Practice of Computer Science, 146–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18381-2_12.

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

Li, Qingyan, Zhixiang Yin, and Min Chen. "Closed Circle DNA Algorithm of Maximum Weighted Independent Set Problem." In Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013, 113–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37502-6_14.

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

Xu, Xinshun, Jun Ma, and Hua Wang. "An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem." In Lecture Notes in Computer Science, 822–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11816157_99.

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

Jena, Sangram K., Ramesh K. Jallu, Gautam K. Das, and Subhas C. Nandy. "The Maximum Distance-d Independent Set Problem on Unit Disk Graphs." In Frontiers in Algorithmics, 68–80. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78455-7_6.

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

Lozin, Vadim, Jérôme Monnot, and Bernard Ries. "On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs." In Lecture Notes in Computer Science, 314–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45278-9_27.

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

Peng, Xue. "Performance Analysis of (1+1)EA on the Maximum Independent Set Problem." In Cloud Computing and Security, 448–56. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27051-7_38.

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

Strash, Darren. "On the Power of Simple Reductions for the Maximum Independent Set Problem." In Lecture Notes in Computer Science, 345–56. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42634-1_28.

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

Conference papers on the topic "Maximum Independent Set problem"

1

Schnorr, Andrea, Dirk N. Helmrich, Hank Childs, Torsten W. Kuhlen, and Bernd Hentschel. "Feature Tracking Utilizing a Maximum-Weight Independent Set Problem." In 2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV). IEEE, 2019. http://dx.doi.org/10.1109/ldav48142.2019.8944363.

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

Taranenko, A., and A. Vesel. "An elitist genetic algorithm for the maximum independent set problem." In Proceedings 23rd International Conference Information Technology Interfaces. ITI 2001. IEEE, 2001. http://dx.doi.org/10.1109/iti.2001.938044.

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

Deng, Changshou, Yanlin Yang, and Hu Peng. "Structure-encoding Differential Evolution for the Maximum Independent Set Problem." In 2011 Fourth International Workshop on Advanced Computational Intelligence (IWACI). IEEE, 2011. http://dx.doi.org/10.1109/iwaci.2011.6159997.

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

Bashar, Mohammad Khairul, Richard Hrdy, Antik Mallick, Farzad Farnoud Hassanzadeh, and Nikhil Shukla. "Solving the Maximum Independent Set Problem using Coupled Relaxation Oscillators." In 2019 Device Research Conference (DRC). IEEE, 2019. http://dx.doi.org/10.1109/drc46940.2019.9046422.

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

Gencer, Mehmet, and Murat Ersen Berberler. "Solution to the maximum independent set problem with genetic algorithm." In 2017 International Conference on Computer Science and Engineering (UBMK). IEEE, 2017. http://dx.doi.org/10.1109/ubmk.2017.8093516.

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

"A NEW HYBRID GENETIC ALGORITHM FOR MAXIMUM INDEPENDENT SET PROBLEM." In 4th International Conference on Software and Data Technologies. SciTePress - Science and and Technology Publications, 2009. http://dx.doi.org/10.5220/0002253403140317.

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

Imanaga, Tomohiro, Koji Nakano, Masaki Tao, Ryota Yasudo, Yasuaki Ito, Yuya Kawamata, Ryota Katsuki, Yusuke Tabata, Takashi Yazane, and Kenichiro Hamano. "Efficient GPU Implementation for Solving the Maximum Independent Set Problem." In 2020 Eighth International Symposium on Computing and Networking (CANDAR). IEEE, 2020. http://dx.doi.org/10.1109/candar51075.2020.00012.

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

Zhixiang, Yin, Song Bosheng, Zhen Cheng, and Hua Cheng. "Molecular Beacon-Based DNA Computing Model for Maximum Independent Set Problem." In 2010 International Conference on Intelligent Computation Technology and Automation (ICICTA). IEEE, 2010. http://dx.doi.org/10.1109/icicta.2010.107.

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

Cheng, Zhen, and Jianhua Xiao. "Implementation of Maximum Independent Set Problem by Algorithmic Tile Self-Assembly." In 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2011. http://dx.doi.org/10.1109/bic-ta.2011.36.

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

Khomami, Mohammad Mehdi Daliri, Negin Bagherpour, Hedieh Sajedi, and Mohammad Reza Meybodi. "A new distributed learning automata based algorithm for maximum independent set problem." In 2016 Artificial Intelligence and Robotics (IRANOPEN). IEEE, 2016. http://dx.doi.org/10.1109/rios.2016.7529512.

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

Reports on the topic "Maximum Independent Set problem"

1

Patel, Reena, David Thompson, Guillermo Riveros, Wayne Hodo, John Peters, and Felipe Acosta. Dimensional analysis of structural response in complex biological structures. Engineer Research and Development Center (U.S.), July 2021. http://dx.doi.org/10.21079/11681/41082.

Full text
Abstract:
The solution to many engineering problems is obtained through the combination of analytical, computational and experimental methods. In many cases, cost or size constraints limit testing of full-scale articles. Similitude allows observations made in the laboratory to be used to extrapolate the behavior to full-scale system by establishing relationships between the results obtained in a scaled experiment and those anticipated for the full-scale prototype. This paper describes the application of the Buckingham Pi theorem to develop a set of non-dimensional parameters that are appropriate for describing the problem of a distributed load applied to the rostrum of the paddlefish. This problem is of interest because previous research has demonstrated that the rostrum is a very efficient structural system. The ultimate goal is to estimate the response of a complex, bio-inspired structure based on the rostrum to blast load. The derived similitude laws are verified through a series of numerical experiments having a maximum error of 3.39%.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Maximum Independent Set problem' for particular source types:
Journal articles Dissertations / Theses
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