832 search results - page 162 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
115
Voted
ICS
2005
Tsinghua U.
15 years 3 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
88
Voted
PE
2010
Springer
14 years 8 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
162
click to vote
SIAMJO
2011
14 years 4 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
109
click to vote
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annea...