1568 search results - page 172 / 314 » The problem of examination questions in algorithmics |
187
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
179
click to vote
IJCNN
2007
IEEE
16 years 21 days ago
2007
IEEE
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
215
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
170
click to vote
IJCAI
2001
15 years 7 months ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
192
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...