17129 search results - page 3302 / 3426 » Applied Computing |
139
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
131
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
126
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
138
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
127
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...