549 search results - page 52 / 110 » On the Complexity of Restricted k-anonymity Problem |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
APVIS
2007
14 years 11 months ago
2007
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
AAAI
2006
14 years 11 months ago
2006
We present a new propagator achieving bound consistency for the INTER-DISTANCE constraint. This constraint ensures that, among a set of variables X1, . . . , Xn, the difference be...