4908 search results - page 278 / 982 » On the Complexity of Optimal K-Anonymity |
188
Voted
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
154
Voted
CPM
2003
Springer
15 years 12 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
153
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents results from on-going investigations into the performance of the Michiganstyle classifier system in a complex multi-agent environment. Using a simplified model...
147
click to vote
JC
2006
15 years 6 months ago
2006
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
183
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...