8125 search results - page 301 / 1625 » Parallelism and evolutionary algorithms |
175
click to vote
LATIN
2010
Springer
15 years 6 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...
173
click to vote
EPS
1997
Springer
15 years 8 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...
IPPS
1999
IEEE
15 years 8 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 ...
138
click to vote
EUROPAR
2004
Springer
15 years 9 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...
158
click to vote
PC
2002
15 years 4 months ago
2002
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...