6105 search results - page 144 / 1221 » A Parallel Algorithm for Bound-Smoothing |
183
click to vote
LATIN
2010
Springer
15 years 7 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...
179
click to vote
EPS
1997
Springer
15 years 9 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...
147
click to vote
EUROPAR
2004
Springer
15 years 10 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...
142
Voted
CASES
2009
ACM
15 years 11 months ago
2009
ACM
Solid State Disks (SSDs) are superior to magnetic disks from a performance point of view due to the favorable features of NAND flash memory. Furthermore, thanks to improvement on...
163
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...