613 search results - page 26 / 123 » The Memory Fragmentation Problem: Solved |
166
Voted
GECCO
2009
Springer
15 years 9 days ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
139
Voted
DOCENG
2006
ACM
15 years 8 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
159
Voted
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
AIED
2007
Springer
15 years 8 months ago
2007
Springer
: This paper proposes the notion of problem templates (PTs), a concept based on theories of memory and expertise. These mental constructs allow experts to quickly recognise problem...
108
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...