8016 search results - page 358 / 1604 » On the practical genetic algorithms |
161
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper describes a novel negotiation protocol for cellular networks, which intelligently improves the performance of the network. Our proposed reactive mechanism enables the d...
167
Voted
DC
2006
15 years 6 months ago
2006
This paper studies the problem of balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentraliz...
171
click to vote
FMSD
2006
15 years 6 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
203
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
190
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...