Sciweavers

341 search results - page 67 / 69
» Learning to satisfy
Sort
View
FMCAD
2004
Springer
13 years 11 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
CCS
2008
ACM
13 years 9 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud
DAC
2005
ACM
13 years 9 months ago
A combined feasibility and performance macromodel for analog circuits
The need to reuse the performance macromodels of an analog circuit topology challenges existing regression based modeling techniques. A model of good reusability should have a num...
Mengmeng Ding, Ranga Vemuri
MC
2003
157views Computer Science» more  MC 2003»
13 years 8 months ago
From Adaptive Hypermedia to the Adaptive Web
Web systems suffer from an inability to satisfy heterogeneous needs of many users. A remedy for the negative effects of the traditional "one-size-fits-all'' approac...
Peter Brusilovsky
VIP
2003
13 years 8 months ago
Optimal Selection of Image Segmentation Algorithms Based on Performance Prediction
Using different algorithms to segment different images is a quite straightforward strategy for automated image segmentation. But the difficulty of the optimal algorithm selection ...
Yong Xia, David Dagan Feng, Rongchun Zhao