3142 search results - page 222 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
123
Voted
ACRI
2006
Springer
15 years 9 months ago
2006
Springer
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
125
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
101
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
135
click to vote
PVM
1999
Springer
15 years 7 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
130
Voted
HEURISTICS
2002
15 years 3 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...