15033 search results - page 264 / 3007 » Complexity Theory and Algorithms |
115
Voted
PODS
2004
ACM
16 years 5 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
141
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
128
click to vote
TALG
2010
15 years 3 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
143
click to vote
FLAIRS
2008
15 years 7 months ago
2008
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
164
click to vote
MAAMAW
1994
Springer
15 years 9 months ago
1994
Springer
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...