نتایج جستجو برای: hard problems in class

تعداد نتایج: 17118094  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان همدان - دانشکده ادبیات و علوم انسانی 1390

abstract this study is an attempt to determine the effect of nano- technology education on science lesson for fifth grade in primary school in the city of kermanshah. this research is experimental and is conducted in the from of pre-test and post- test for the control group. an achievement test was administered to determine the rate of learning in the students. the research is an applied one. ...

Journal: :journal of advances in computer research 2013
narges mahmoodi darani vahid ahmadi zahra saadati eskandari majid yousefikhoshbakht

the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...

Journal: :journal of optimization in industrial engineering 2014
hossein larki majid yousefikhoshbakht

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 1996
Sanjeev Khanna Madhu Sudan

In 1978, Schaefer [12] considered a subclass of languages in NP and proved a “dichotomy theorem” for this class. The subclass considered were problems expressible as “constraint satisfaction problems”, and the “dichotomy theorem” showed that every language in this class is either in P, or is NP-hard. This result is in sharp contrast to a result of Ladner [9], which shows that such a dichotomy d...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده ادبیات، زبانهای خارجی و تاریخ 1391

the aim of conducting this study was to investigate the foreign language learning needs of undergraduate economics students and business management students in faculties of social sciences of alzahra and azad naragh university. in the study, which was designed on the basis of a qualitative-quantitative basis using interviews and questionnaires, 146 female undergraduate business management as we...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده حقوق 1389

abstract the third millennium has started, but the world is facing with serious challenges in achieving international security and peace. various human rights violations have lead the states to find means to protect human rights. also article 55 of the united nations charter introduces the respect to human rights and fundamental freedom as the most suitable ways to realize peace and security. ...

2011
Michael R. Fellows Charles Darwin Jiong Guo Hannes Moser Rolf Niedermeier

We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving NP-hard minimization problems. The core issue (particularly but not only motivated by iterative compression) is to determine the computational complexity of the following task: given an already inclusion-minimal solution...

2017
Sarah Carruthers Ulrike Stege Michael E. J. Masson

The role that the mental, or internal, representation plays when people are solving hard computational problems has largely been overlooked to date, despite the reality that this internal representation drives problem solving. In this work we investigate how performance on versions of two hard computational problems differs based on what internal representations can be generated. Our findings s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید