نتایج جستجو برای: hard problem so

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

2008
Nathan Ensmenger Michael Mahoney Richard Canning

In the very last published article of his long and distinguished career, the eminent historian of computing Michael Mahoney asked a simple but profound question: “What makes the history of soŸware hard?’’ In his characteristically playful style, Mike was engaging both with an issue of central importance to historians – namely, how can we begin to come to grips with the formidable challenges of ...

Journal: :Practical Neurology 2016

Journal: :Annals of Clinical Biochemistry: International Journal of Laboratory Medicine 2006

Journal: :مهندسی صنایع 0
عرفان مهمانچی مهندسی صنایع- دانشگاه صنعتی شریف شهرام شادرخ دانشکده مهندسی صنایع- دانشگاه صنعتی شریف

the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...

Journal: :North Carolina Medical Journal 2002

Journal: :Journal of Forensic Research 2017

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...

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

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