14386 search results - page 226 / 2878 » The Chinese Generals Problem |
137
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
156
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
151
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
166
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
165
click to vote
WSNA
2003
ACM
15 years 9 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...