1310 search results - page 34 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
160
click to vote
PDPTA
2000
15 years 6 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
135
click to vote
TEC
2008
15 years 4 months ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
130
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
121
click to vote
EOR
2007
15 years 4 months ago
2007
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
133
click to vote
ITICSE
1997
ACM
15 years 8 months ago
1997
ACM
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...