4908 search results - page 173 / 982 » On the Complexity of Optimal K-Anonymity |
178
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
167
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
171
click to vote
ISCAS
2007
IEEE
16 years 24 days ago
2007
IEEE
-- In interconnect-dominated designs, the ability to minimize layout-induced parasitic effects is crucial for rapid design closure. Deep sub-micron effects and ubiquitous interfere...
153
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
This paper presents an applicable model for complex multiattribute negotiations between autonomous agents. The model adopts a novel protocol which decomposes the original n-dimens...
152
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...