4908 search results - page 652 / 982 » On the Complexity of Optimal K-Anonymity |
190
click to vote
INFOCOM
1994
IEEE
15 years 11 months ago
1994
IEEE
A n eficient fair queueing scheme which is feasible for broadband implementation is proposed and its performance is analyzed. We define fairness in a selfcontained manner, elimina...
174
click to vote
TIME
1994
IEEE
15 years 11 months ago
1994
IEEE
: In this paper we explain how we have integrated the functionalities of a constraint management system and a temporal data base system to enable a model-based control of systems t...
174
Voted
KR
1989
Springer
15 years 11 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
156
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
167
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
The scaling of CMOS technology into the nanometer era enables the fabrication of highly integrated systems, which increasingly contain analog and/or RF parts. However, scaling into...