2080 search results - page 130 / 416 » Measuring empirical computational complexity |
153
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
167
click to vote
NECO
2011
14 years 11 months ago
2011
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
138
click to vote
ACSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
128
click to vote
JAR
2000
15 years 4 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
136
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— Simple, fast and lightweight SLAM algorithms are necessary in many embedded robotic systems which soon will be used in houses and offices in order to do various service tasks....