832 search results - page 118 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
CP
2004
Springer
15 years 3 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
APL
1993
ACM
15 years 1 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
100
click to vote
EC
2000
14 years 9 months ago
2000
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
156
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...