2168 search results - page 190 / 434 » Randomized Algorithms and Complexity Theory |
92
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
155
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
139
Voted
CANDC
2005
ACM
15 years 5 months ago
2005
ACM
The story of some early computer art drawings in 1965 is told. It is a story of randomness. Computer art is viewed here as the programming of classes of aesthetic objects. In the ...
137
Voted
AAECC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
135
Voted
CLEIEJ
2002
15 years 3 months ago
2002
Function Point Analysis (FPA) is among the most commonly used techniques to estimate the size of software system projects or software systems. During the point counting process th...