600 search results - page 103 / 120 » Problems and results in extremal combinatorics - II |
79
Voted
AISB
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
FLAIRS
2008
15 years 7 hour ago
2008
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
AIPS
2009
14 years 10 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...