4908 search results - page 789 / 982 » On the Complexity of Optimal K-Anonymity |
152
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
Many software projects fail because early life-cycle defects such as ill-defined requirements are not identified and removed. Therefore, quality assurance (QA) techniques for defe...
144
click to vote
IAT
2003
IEEE
15 years 12 months ago
2003
IEEE
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
241
click to vote
ICTAI
2003
IEEE
15 years 12 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
155
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
184
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...