5214 search results - page 233 / 1043 » The Online Specialization Problem |
191
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
174
click to vote
MP
2002
15 years 5 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
265
click to vote
ASPLOS
2009
ACM
16 years 6 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
169
click to vote
KDD
2001
ACM
16 years 6 months ago
2001
ACM
During the last decade, the area of bioinformatics has produced an overwhelming amount of data, with the recently published draft of the human genome being the most prominent exam...
155
click to vote
ACSAC
2009
IEEE
16 years 25 days ago
2009
IEEE
—We study a new application of threshold-based secret sharing in a distributed online social network (DOSN), where users need a means to back up and recover their private keys in...