850 search results - page 80 / 170 » On Genetic Algorithms and Lindenmayer Systems |
166
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
186
click to vote
TREC
2003
15 years 7 months ago
2003
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
198
click to vote
ALIFE
2005
15 years 6 months ago
2005
We present a new definition of the concept of representation for cognitive science that is based on a study of the origin of structures that are used to store memory in evolving sy...
161
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
172
click to vote
GPEM
2008
15 years 6 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...