[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [Taler] optimal coin spending

**From**: |
Christian Grothoff |

**Subject**: |
Re: [Taler] optimal coin spending |

**Date**: |
Sat, 19 Dec 2015 10:12:27 +0100 |

**User-agent**: |
Mozilla/5.0 (X11; Linux i686; rv:38.0) Gecko/20100101 Thunderbird/38.4.0 |

The real question is if we need the power of LP, or if a linear
heuristic is not more appropriate for the Wallet. I'd be worried about
both the code size increase and the possible increase in worst-case
execution time (LP solvers can be a bit unpredictable). Does the solver
support producing partial solutions (i.e. within X% of optimal, or best
feasible solution found within 500 ms)?
Regardless, I still think at least initially we should go for a greedy
heuristic.
On 12/19/2015 02:42 AM, Jeff Burdges wrote:
>* *
>* Appears this might be the JavaScript integer program solver that's*
>* actually usable :*
>* https://github.com/JWally/jsLPSolver*
>* *
>* via https://stackoverflow.com/questions/6445736/has-anyone-seen-a-simp*
>* lex-library-for-javascript-nodejs*
>* *
>* *
>* *
>* *
>* On Fri, 2015-12-18 at 14:26 +0100, Jeff Burdges wrote:*
>*> Just to answer Marcello's question from this evening about optimal *
>*> coin spending. -Jeff*
>* *

**
**`signature.asc`

*Description:* OpenPGP digital signature

**[Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/18`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/18`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/18`
**Re: [Taler] optimal coin spending**,
*Christian Grothoff* **<=**
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/19`
**Re: [Taler] optimal coin spending**, *Christian Grothoff*, `2015/12/20`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/20`
**Re: [Taler] optimal coin spending**, *Christian Grothoff*, `2015/12/20`
**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/20`

**Re: [Taler] optimal coin spending**, *Jeff Burdges*, `2015/12/19`