نتایج جستجو برای: np hard

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

Journal: :Physical Review Letters 2021

Variational quantum algorithms are proposed to solve relevant computational problems on near term devices. Popular versions variational eigensolvers and ap- proximate optimization that ground state from chemistry binary problems, respectively. They based the idea of using a classical computer train parameterized circuit. We show corresponding NP-hard. Moreover, hardness is robust in sense that,...

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

تمایل ارگان ها برای یکپارچه سازی و توانایی زنجیره ی تأمینشان در کاهش هزینه ها ، قدرت سرویس دهی بهتر به مشتریان و کاهش فشارهای عمومی به سازمان ، روند های جدیدی را در کسب و کار ایجاد کرده است. این گرایش ها، فرصتی جهانی در جهت برآورده کردن انتظارات محیطی دولت و مشتریان از طریق زنجیره ی تأمین سبز فراهم کرده است. افزایش فشارهای دولتی بر صنایع به منظور کاهش تأثیرات مخرب کسب و کار بر محیط، از یک سو و ...

Journal: :journal of advances in computer research 2012
majid yousefikhoshbakht farzad didehvar farhad rahmati

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

Journal: :journal of advances in computer research 0

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Journal: :CoRR 2014
Toby Walsh

We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.

Journal: :Protein engineering 2002
Niles A Pierce Erik Winfree

Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context of this observation, to provide a simple i...

2016
Amy Chou

In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...

Journal: :IEEE Trans. Computers 1993
Keumog Ahn Sartaj Sahni

Preplaced circuit modules may be rotated to improve performance and/or routability. We show that several simple versions of the module rotation problem are NP-hard.

Journal: :CoRR 2016
Romeo Rizzi Massimo Cairo Veli Mäkinen Daniel Valenzuela

Human genomes consist of pairs of homologous chromosomes, one of which is inherited from the mother and the other from the father. Species, such as human, with pairs of homologous chromosomes are called diploid. Sequence analysis literature is, however, almost solely built under the model of a single haplotype sequence representing a species. This fundamental choice is apparently due to the hug...

Journal: :Int. J. Comput. Geometry Appl. 2011
Guillaume Batog Xavier Goaoc

A collection C of balls in R is δ-inflatable if it is isometric to the intersection U ∩ E of some d-dimensional affine subspace E with a collection U of (d + δ)-dimensional balls that are disjoint and have equal radius. We give a quadratic-time algorithm to recognize 1-inflatable collections of balls in any fixed dimension, and show that recognizing δ-inflatable collections of d-dimensional bal...

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

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