1382 search results - page 114 / 277 » Formal Analysis of Online Algorithms |
156
click to vote
EDBT
2009
ACM
16 years 28 days ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
171
Voted
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
178
Voted
FMCAD
2004
Springer
15 years 10 months ago
2004
Springer
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...
185
click to vote
ATVA
2007
Springer
16 years 10 days ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
171
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...