1207 search results - page 69 / 242 » Towards optimal k-anonymization |
114
click to vote
AAAI
2000
15 years 2 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
95
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
109
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...
100
Voted
CEC
2010
IEEE
15 years 1 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...
112
click to vote
SIAMJO
2008
15 years 20 days ago
2008
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...