390 search results - page 26 / 78 » When is an estimation of distribution algorithm better than ... |
TKDE
2002
13 years 7 months ago
2002
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
ALGORITHMICA
1999
13 years 7 months ago
1999
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
HOTI
2002
IEEE
14 years 10 days ago
2002
IEEE
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...