3422 search results - page 195 / 685 » Random Subset Optimization |
147
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
151
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
150
click to vote
IJKESDP
2010
15 years 4 months ago
2010
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
156
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...