Sciweavers

118 search results - page 16 / 24
» Implementation of State Elimination Using Heuristics
Sort
View
ICDE
2005
IEEE
121views Database» more  ICDE 2005»
14 years 8 months ago
Top-Down Specialization for Information and Privacy Preservation
Releasing person-specific data in its most specific state poses a threat to individual privacy. This paper presents a practical and efficient algorithm for determining a generaliz...
Benjamin C. M. Fung, Ke Wang, Philip S. Yu
ICSE
2000
IEEE-ACM
13 years 11 months ago
Quickly detecting relevant program invariants
Explicitly stated program invariants can help programmers by characterizing certain aspects of program execution and identifying program properties that must be preserved when mod...
Michael D. Ernst, Adam Czeisler, William G. Griswo...
AAAI
2006
13 years 8 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
ET
2002
67views more  ET 2002»
13 years 7 months ago
On-the-Fly Reseeding: A New Reseeding Technique for Test-Per-Clock BIST
In this paper we present a new reseeding technique for test-per-clock test pattern generation suitable for at-speed testing of circuits with random-pattern resistant faults. Our te...
Emmanouil Kalligeros, Xrysovalantis Kavousianos, D...
IWCLS
2007
Springer
14 years 1 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull