Sciweavers

430 search results - page 47 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
DKE
2008
106views more  DKE 2008»
14 years 10 months ago
Towards optimal k-anonymization
When releasing microdata for research purposes, one needs to preserve the privacy of respondents while maximizing data utility. An approach that has been studied extensively in re...
Tiancheng Li, Ninghui Li
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 4 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
ISCI
2008
116views more  ISCI 2008»
14 years 10 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
GECCO
2006
Springer
253views Optimization» more  GECCO 2006»
15 years 2 months ago
A novel approach to optimize clone refactoring activity
Achieving a high quality and cost-effective tests is a major concern for software buyers and sellers. Using tools and integrating techniques to carry out low cost testing are chal...
Salah Bouktif, Giuliano Antoniol, Ettore Merlo, Ma...
CP
2005
Springer
15 years 4 months ago
Applying Constraint Programming to Rigid Body Protein Docking
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
Ludwig Krippahl, Pedro Barahona