programming problem about elements taken
- To: mathgroup at smc.vnet.net
- Subject: [mg72470] programming problem about elements taken
- From: "Barrow" <GRseminar at gmail.com>
- Date: Sat, 30 Dec 2006 05:39:44 -0500 (EST)
Dear all, I have a list of numbers (A),in fact, they are numbers distributed over [0,1]. Given parameter \epsilon, I have to choose elements from A such that their distances are larger than \epsilon, so the elements are "distringuishable". My goal is to find the maximum number of elements from A to meet the above "distinct criterion". How to do it with the functions build-in in mathematica ?? Thanks in advence. Sincerely Barrow
- Follow-Ups:
- Re: programming problem about elements taken
- From: Andrzej Kozlowski <akoz@mimuw.edu.pl>
- Re: programming problem about elements taken