6542 search results - page 119 / 1309 » The tao of parallelism in algorithms |
176
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa ...
207
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
203
click to vote
EPS
1997
Springer
15 years 10 months ago
1997
Springer
This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better trans...
118
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
167
click to vote
EUROPAR
2004
Springer
15 years 12 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...