6102 search results - page 768 / 1221 » Generating Optimizing Specializers |
194
click to vote
CSFW
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
216
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
212
click to vote
ACNS
2009
Springer
16 years 1 months ago
2009
Springer
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
189
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
170
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...