نتایج جستجو برای: 66 sassanid coins
تعداد نتایج: 66148 فیلتر نتایج به سال:
In this study we report the underlying reasons to why bacteria are present on banknotes and coins. Despite the use of credit cards, mobile phone apps, near-field-communication systems, and cryptocurrencies such as bitcoins which are replacing the use of hard currencies, cash exchanges still make up a significant means of exchange for a wide range of purchases. The literature is awash with data ...
water has been perfectly respectable in ancient persia. there was some god to preserve and protect the water. among of them anahita was considered the most popular. anahita statues and popularity could be seen by surveys of the iranian ancient art works. no doubt, the most important factor is the permanent presence of anahita comeback to the existence and continuity of mythological and religiou...
We consider the k-payment problem: given a total budget of N units, represent this budget as a set of coins, so that any k exact payment requests of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k The actual payments are made on-line, namely without knowing all payment requests in advance. Our motivation ...
We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any givenN and k, while allowing the actual payments to be made on-line, namely without the need to know all payment ...
During two seasons of archaeological excavations on the historical site of Veliran of Damavand, some structural remnants dating to the Sassanid period were identified. The structure consists of a tower and a rampart, as well as several rooms organized on the two sides of a passage. The architectural findings in the archeological site of Veliran help us know the Damavand region as it was during ...
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, and moves are defined as collision free translations, all in the Euclidean plane. We obtain combinatorial bounds on the number of moves that are necessary and/or sufficient to move coins from one configuration to anothe...
Abstract. We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k, while allowing the actual payments to be made on-line, namely without the need to know ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید