Dynamic phase diagram of the number partitioning problem
نویسندگان
چکیده
منابع مشابه
Dynamic phase diagram of the number partitioning problem.
We study the dynamic phase diagram of a spin model associated with the number partitioning problem, as a function of temperature and of the fraction K/N of spins allowed to flip simultaneously. The case K=1 reproduces the activated behavior of Bouchaud's trap model, whereas the opposite limit K=N can be mapped onto the entropic trap model proposed by Barrat and Mézard. In the intermediate case ...
متن کاملPhase Diagram for the Constrained Integer Partitioning Problem
We consider the problem of partitioning n integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen uniformly from the set {1, . . . , M}. We study how the typical behavior of the optimal partition depends on n, M and the bias s, the difference between the cardinal...
متن کاملPhase transition and landscape statistics of the number partitioning problem.
The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in the space of control parameters in which almost all instances have many solutions to a region in which almost all instances have no solution, is investigated by examining the energy landscape of this classic optimization problem. This is achieved by coding the information about the minimum energ...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولProbabilistic Analysis of the Number Partitioning Problem
Given a sequence of N positive real numbers {a1, a2, . . . , aN}, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of aj over the two sets is minimized. In the case that the aj ’s are statistically independent random variables uniformly distributed in the unit interval, this NP-complete problem is equivalent t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2004
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.70.066126