4908 search results - page 674 / 982 » On the Complexity of Optimal K-Anonymity |
165
click to vote
EOR
2007
15 years 6 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
169
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
169
click to vote
EOR
2007
15 years 6 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
210
click to vote
NJC
2006
15 years 6 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
190
click to vote
ADT
2005
15 years 6 months ago
2005
: The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this proble...