1464 search results - page 90 / 293 » On optimal anonymization for l -diversity |
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
180
click to vote
TCAD
2008
15 years 6 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
172
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
153
click to vote
JCC
2010
15 years 4 months ago
2010
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
165
click to vote
EOR
2011
15 years 1 months ago
2011
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...