Re-Formulation of Mean King’s Problem Using Shannon’s Entropy
نویسندگان
چکیده
منابع مشابه
The Problem of the Kings
On a 2m 2n chessboard, the maximum number of nonattacking kings that can be placed is mn, since each 22 cell can have at most one king. Let f m (n) denote the number of ways that mn nonattacking kings can be placed on a 2m 2n chessboard. The purpose of this paper is to prove the following result. such that f m (n) = (c m n + d m)(m + 1) n + O(n m) (n ! 1): For every such placement of kings, the...
متن کاملData Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
Consider a point-set coming from an object which was sampled using a digital sensor (depth range, camera, etc). We are interested in finding a graph that would represent that point-set according to some properties. Such a representation would allow us to match two objects (graphs) by exploiting topological properties instead of solely relying on geometrical properties. The Delaunay triangulatio...
متن کاملA Learning and Inference Mechanism for Design Optimization Problem (re)-formulation Using Singular Value Decomposition
This paper presents a knowledge-lean learning and inference mechanism based on Singular Value Decomposition (SVD) for design optimization problem (re)-formulation at the problem modeling stage. The distinguishing feature of the mechanism is that it requires very few training cases to extract and generalize knowledge for large classes of problems sharing similar characteristics. The genesis of t...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولCentroid of an Interval Type-2 Fuzzy Set Re-Formulation of the Problem
In theory of interval type-2 (IT2) fuzzy sets, type-reduction is one of the most difficult parts. Karnik-Mendel (KM) algorithms have been the most popular method for computing type-reduction of IT2 fuzzy sets. These algorithms present two independent procedures for computing the generalized centroid of an IT2 fuzzy set: the first one for computing its left part (denoted by cl), and the second o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Quantum Information Science
سال: 2013
ISSN: 2162-5751,2162-576X
DOI: 10.4236/jqis.2013.31002