4110 search results - page 14 / 822 » Efficient algorithms for the 2-gathering problem |
102
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...
205
click to vote
IJIT
2004
15 years 4 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
101
click to vote
INFORMATICALT
2006
15 years 3 months ago
2006
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
125
click to vote
EOR
2006
15 years 3 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
145
Voted
JALC
2002
15 years 3 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...