518 search results - page 33 / 104 » Beating a Random Assignment |
156
click to vote
ESA
2011
Springer
14 years 2 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
EUSFLAT
2007
15 years 3 months ago
2007
Probability intervals are imprecise probability assignments over elementary events. They constitute a very convenient tool to model uncertain information : two common cases are co...
114
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
117
Voted
CCS
2008
ACM
15 years 4 months ago
2008
ACM
Role Engineering is a security-critical task for systems using role-based access control (RBAC). Different role-mining approaches have been proposed that attempt to automatically ...
CORR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract: Iterating between a router and a traffic micro-simulation is an increasibly accepted method for doing traffic assignment. This paper, after pointing out that the analytic...