952 search results - page 77 / 191 » Computational complexity of stochastic programming problems |
91
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
90
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
141
Voted
UPP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
146
click to vote
LOGCOM
2010
14 years 7 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...