4908 search results - page 64 / 982 » On the Complexity of Optimal K-Anonymity |
176
click to vote
DEBU
2008
15 years 6 months ago
2008
Query optimization is an inherently complex problem, and validating the correctness and effectiveness of a query optimizer can be a task of comparable complexity. The overall proc...
195
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
152
click to vote
ICRA
2006
IEEE
16 years 6 days ago
2006
IEEE
— Many methods exist for the automatic and optimal 3D reconstruction of camera motion and scene structure from image sequence (’Structure from Motion‘ or SfM). The solution t...
151
click to vote
ATAL
2001
Springer
15 years 10 months ago
2001
Springer
We present a simple model of distributed multi-agent multi-issued contract negotiation for open systems where interactions are competitive and information is private and not shared...
144
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...