OnlineWoerterBuecher.de
Internes

Lexikon


post office problem


Given a set of points (in N dimenSIons), find another point which minimises the sum of the distances from that point to each of the others.

In addition suitable contents:
[ an ] [ at ] [ ch ] [ er ] [ es ] [ et ] [ fi ] [ fr ] [ G ] [ h ] [ hat ] [ in ] [ int ] [ io ] [ is ] [ N ] [ nc ] [ ni ] [ no ] [ ns ] [ om ] [ point ] [ ro ] [ se ] [ set ] [ SI ] [ st ] [ su ] [ sum ] [ th ] [ to ] [ um ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (868 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.101 Seconds, with 16 Database-Queries
Zurück zur Startseite