Sciweavers

115 search results - page 5 / 23
» Privacy Guarantees through Distributed Constraint Satisfacti...
Sort
View
AAAI
2000
13 years 8 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
AI
2005
Springer
13 years 7 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
ICDT
2005
ACM
117views Database» more  ICDT 2005»
14 years 1 months ago
Privacy in Database Publishing
We formulate and study a privacy guarantee to data owners, who share information with clients by publishing views of a proprietary database. The owner identifies the sensitive pro...
Alin Deutsch, Yannis Papakonstantinou
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
13 years 11 months ago
Preserving Privacy through Data Generation
Many databases will not or can not be disclosed without strong guarantees that no sensitive information can be extracted. To address this concern several data perturbation techniq...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
ATAL
2003
Springer
14 years 22 days ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...