4908 search results - page 294 / 982 » On the Complexity of Optimal K-Anonymity |
203
click to vote
ANTSW
2008
Springer
15 years 8 months ago
2008
Springer
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
197
Voted
AAAI
2010
15 years 8 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
201
click to vote
ISCAPDCS
2001
15 years 8 months ago
2001
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
258
click to vote
WSC
2001
15 years 8 months ago
2001
Tactical and operational planning for manufacturing enterprises are more important today than ever before as their supply chains span the globe. Two state-of-the-art technologies ...
222
click to vote
TJS
2002
15 years 6 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...