4908 search results - page 373 / 982 » On the Complexity of Optimal K-Anonymity |
191
click to vote
NICSO
2010
Springer
15 years 10 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
176
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies bilateral, multi-issue negotiation between self-interested agents with deadlines. There are a number of procedures for negotiating the issues and each of these g...
190
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Nearest neighbor forecasting models are attractive with their simplicity and the ability to predict complex nonlinear behavior. They rely on the assumption that observations simila...
180
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
195
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...