Sciweavers

881 search results - page 3 / 177
» Solving satisfiability problems with preferences
Sort
View
IPPS
1999
IEEE
14 years 26 days ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
DASFAA
2009
IEEE
129views Database» more  DASFAA 2009»
14 years 3 months ago
Towards Preference-Constrained k-Anonymisation
Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
Grigorios Loukides, Achilles Tziatzios, Jianhua Sh...