Sciweavers

1464 search results - page 141 / 293
» On optimal anonymization for l -diversity
Sort
View
COCO
2003
Springer
135views Algorithms» more  COCO 2003»
15 years 11 months ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
GECCO
2006
Springer
138views Optimization» more  GECCO 2006»
15 years 10 months ago
Does overfitting affect performance in estimation of distribution algorithms
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...
Hao Wu, Jonathan L. Shapiro
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
Single and multi-objective genetic operators in object-oriented conceptual software design
This poster paper investigates the potential of single and multiobjective genetic operators with an object-oriented conceptual design space. Using cohesion as an objective fitness...
Christopher L. Simons, Ian C. Parmee
ICDCS
1995
IEEE
15 years 10 months ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch
ICPP
1991
IEEE
15 years 10 months ago
Emulation of a PRAM on Leveled Networks
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
Michael A. Palis, Sanguthevar Rajasekaran, David S...