نتایج جستجو برای: hard problems in class
تعداد نتایج: 17118094 فیلتر نتایج به سال:
In a large social media corpus (2.9 million tokens), we analyze Flemish adolescents’ non-standard writing practices and look for correlations with the teenagers’ social class. Three different aspects of adolescents’ social background are included: educational track, parental profession, and home language. Since the data reveal that these parameters are highly correlated, we combine them into on...
It has previously been proven that finding the globally minimum energy configuration of an atomic cluster belongs in the class of NP-hard problems. However, this proof is limited only to homonuclear clusters. This paper presents a new proof which shows finding minimum energy configurations for heteronuclear clusters is also NP-hard.
chapter one is devotod to collect some notion and background informations, which are needed in the next chapters. it also contains some important statements which will be proved in a more general context later in this thesis. in chapter two, we show that if the marginal factor-group is of order np1...pk,n>1, then we obtain a bound for the order of the verbal subgroup. also a bound for the bear-...
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
anxiety is one common disorder during childhood. in curing anxiety disorders, there are different types of psychological remedies, pharmotherapy, family therapy, and music therapy that can improve the individual’s anxiety, but we need some other remedies to improve social and emotional relationship and interactions. considering the importance of curing the anxiety disorders, the effect of sand ...
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The problems are relevant for assessing network reliability and improving the network’s performance and fault tolerance. The main technique considered in this paper ...
this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...
This paper identiies the complexity class of statically constructed partially deceptive problems by proving a turing reduction of 3-SAT problem to partially deceptive problem. This essentially proves that the class of partially deceptive problems is NP-turing complete and one may not be able to nd a polynomial complexity algorithm for solving deceptive problems unless P = NP. This paper also ad...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید