2413 search results - page 54 / 483 » Understanding the problem |
COGSR
2011
14 years 6 months ago
2011
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
PPSN
2004
Springer
15 years 4 months ago
2004
Springer
Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa i...
112
click to vote
SAT
2009
Springer
15 years 5 months ago
2009
Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
101
click to vote
CP
2005
Springer
15 years 4 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...