11740 search results - page 168 / 2348 » More Problems in Rewriting |
155
click to vote
JCO
2008
15 years 4 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
149
click to vote
ICNS
2009
IEEE
15 years 2 months ago
2009
IEEE
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
125
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
136
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
111
click to vote
ISICA
2007
Springer
15 years 10 months ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...