11051 search results - page 378 / 2211 » An Investigation of Generalized Cases |
195
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
193
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
Modeling is now an essential ingredient in business process management and information systems development. The general usefulness of models in these areas is therefore generally ...
208
click to vote
TIME
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
201
click to vote
LPNMR
2005
Springer
16 years 1 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
191
click to vote
JAIR
2008
15 years 7 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...