نتایج جستجو برای: coins

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

2016
Frank Vriesekoop Jing Chen Jenna Oldaker Flavien Besnard Reece Smith William Leversha Cheralee Smith-Arnold Julie Worrall Emily Rufray Qipeng Yuan Hao Liang Amalia Scannell Cryn Russell

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

Journal: :Computational Geometry 2006

Journal: :Emergency Medicine Journal 1999

Journal: :Scientific American 1896

1997
Yair Frankel Boaz Patt-Shamir Yiannis Tsiounis

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

1997
Pat Frankel

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

Journal: :Comput. Geom. 2006
Manuel Abellanas Sergey Bereg Ferran Hurtado Alfredo García Olaverri David Rappaport Javier Tejel

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

Journal: :SIAM J. Discrete Math. 2000
Boaz Patt-Shamir Yiannis Tsiounis Yair Frankel

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

2004
Stéphane Gaubert Yvon Maday

On suppose le domaine Ω régulier. Justi er que les solutions propres sont aussi régulières, préciser cette régularité. Noter bien (on ne demande pas de le justi er) que si le domaine possède des coins, les solutions propres peuvent, comme pour le problème de Laplace avec un second membre, présenter des singularités aux coins du domaine. En dehors de ces coins, la solution est par contre de clas...

2000
Wlodek Rabinowicz John Broome

Imagine the following game, which is commonly called a ‘centipede game’. There is a pile of pound coins on the table. X and Y take it in turns to take either one or two coins from the pile, and they keep the coins they take. However, as soon as either of them takes two coins, the game stops, and the rest of the coins are cleared away. So long as they each take only one coin when their turn come...

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

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