4908 search results - page 243 / 982 » On the Complexity of Optimal K-Anonymity |
261
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
172
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In orthodontics, retraction springs made of metallic wires are often used to move a tooth with respect to another by the virtue of the spring back effect. Specially selected form o...
195
click to vote
AAMAS
2010
Springer
15 years 6 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
152
click to vote
CONCURRENCY
2006
15 years 6 months ago
2006
To keep up with a large degree of instruction level parallelism (ILP), the Itanium 2 cache systems use a complex organization scheme: load/store queues, banking and interleaving. ...
152
click to vote
NECO
2006
2006
Optimal Spike-Timing-Dependent Plasticity for Precise Action Potential Firing in Supervised Learning
15 years 6 months ago
In timing-based neural codes, neurons have to emit action potentials at precise moments in time. We use a supervised learning paradigm to derive a synaptic update rule that optimi...