Аннотация

The chance of solving a problem by random search of linear random programs tends to a limit as their size increases. When all outputs are equally used this limit is no more than 2**(-|test set|). Where |test set| is the size of the total test set. This is a generalisation of a previous result, langdon:1999:sptfs. Secondly, we show the chance of finding a long linear general solution by random search is exponentially small.

Линки и ресурсы

тэги

сообщество

  • @brazovayeye
  • @dblp
@brazovayeye- тэги данного пользователя выделены