OnlineWoerterBuecher.de
Internes

Lexikon


approximation algorithm


Gorithm> An alGorithm for an optimisation problem that generates feasible but not necessarily optimal solutions. Unlike "heuristic", the term "approximation alGorithm" often implies some proven worst or average case bound on performance. The terms are often used interchangeably however. (1997-10-28)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ al ] [ alGorithm ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ b ] [ bo ] [ ca ] [ case ] [ ch ] [ du ] [ ec ] [ ed ] [ er ] [ era ] [ es ] [ feasible ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gen ] [ generate ] [ h ] [ hang ] [ hat ] [ heuristic ] [ hm ] [ hr ] [ id ] [ ie ] [ il ] [ implies ] [ in ] [ int ] [ io ] [ is ] [ it ] [ ke ] [ Lex ] [ li ] [ lu ] [ ly ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ ng ] [ nl ] [ no ] [ ns ] [ om ] [ op ] [ optimal ] [ pe ] [ perf ] [ ph ] [ pl ] [ pr ] [ pt ] [ query ] [ rc ] [ re ] [ ro ] [ sa ] [ se ] [ si ] [ so ] [ solution ] [ st ] [ T ] [ th ] [ us ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3728 Reads)

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

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