4908 search results - page 761 / 982 » On the Complexity of Optimal K-Anonymity |
150
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
157
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
168
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
165
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
180
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...