نتایج جستجو برای: maximal independent dominating
تعداد نتایج: 538396 فیلتر نتایج به سال:
The MIS data is critical to an organization and should be protected from misuse by wrong persons. Although The MIS data is typically meant for the senior managers each MIS report may not be required by every manager. The access to MIS data is determined by the role of an individual in the organization and controlled by the MIS administrator accordingly. The access is generally determined by the...
The question of the relevance of MIS research to practitioners is part of the broader question of the match between academic research goals and the goals of constituents. We call for a broader conception of who those constituents might be, and the implications that has for the activities of MIS academics.
Flipped classroom is one approach of active learning leading to better students’ learning, abilities, and academic performance. The aim of this study is to evaluate the effect of applying the flipped classroom approach to MIS course, to examine the antecedents of engagement intention after participating the flipped classroom by peers, and to guide key factors of success student presentations. T...
An independent dominating set of a graph, also known as maximal set, is S pairwise non-adjacent vertices such that every vertex not in adjacent to some S. We prove for Δ=4 or Δ≥6, connected n-vertex graph maximum degree at most Δ has an size (1−Δ⌊Δ2/4⌋+Δ)(n−1)+1. In addition, we characterize all graphs having the equality and show other have (1−Δ⌊Δ2/4⌋+Δ)n.
This article reports the results of an experimental analysis of the impact of MIS design variables on managers" evaluations of subordinates" performances. The experiment involved examining whether different ways of reporting a specific standard cost accounting situation resulted in differences in managers’ evaluations. When actual costs differed significantly from standard, it was found that th...
Web-based learning has been suggested to be the future of all types of distance learning. This study was undertaken to identify the impact of student learning styles, learning patterns, and other selected factors on their learning performance in a Web Course Tools (WebCT) MIS graduate course. Six specific research questions were developed and 76 graduate students participated in this study. It ...
Over the past few years, our institution has been in the process of rethinking the structure of our College of Business curriculum. This is motivated by three major factors: Demands of industry for the inclusion of “soft skills” in our curriculum, the recent emphasis by AACSB on assessment of student learning, and dissatisfaction with the performance of the core MIS course. This paper describes...
In this paper we extend the lower bound technique by Linial for local coloring and maximal independent sets. We show that constant approximations to maximum independent sets on a ring require at least log-star time. More generally, the product of approximation quality and running time cannot be less than log-star. Using a generalized ring topology, we gain identical lower bounds for approximati...
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
The n-dimensional hypercube Qn has many maximal independent sets of vertices. We study the cardinality of those maximal independent sets which are balanced , i.e. exactly half of whose vertices have even weight, obtaining both upper and lower bounds for the maximum value. For n ≤ 7 we obtain the exact value. For all odd n, we conjecture that the exact value is 2n−1 − ( n−1 (n−1)/2 ) . We also c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید