4908 search results - page 53 / 982 » On the Complexity of Optimal K-Anonymity |
150
click to vote
WG
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
126
click to vote
DSD
2002
IEEE
15 years 11 months ago
2002
IEEE
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
187
click to vote
EAAI
2010
15 years 4 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
198
click to vote
ISQED
2011
IEEE
14 years 9 months ago
2011
IEEE
—Design optimization methodologies for AMS-SoCs with analog, digital, and mixed-signal portions have not received significant attention, due to their high complexity. In mixed-s...
177
click to vote
SRDS
2010
IEEE
15 years 4 months ago
2010
IEEE
With the growing scale of current computing systems, traditional configuration tuning methods become less effective because they usually assume a small number of parameters in the...