4908 search results - page 896 / 982 » On the Complexity of Optimal K-Anonymity |
109
click to vote
DLOG
2006
15 years 1 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
105
click to vote
CIDR
2003
15 years 1 months ago
2003
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
135
click to vote
IJCAI
2003
2003
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
15 years 1 months ago
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
105
click to vote
IJCAI
1997
15 years 1 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
GECCO
2008
Springer
15 years 29 days ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...