Sciweavers

188 search results - page 7 / 38
» Finding Best k Policies
Sort
View
ESORICS
2006
Springer
14 years 6 days ago
Finding Peer-to-Peer File-Sharing Using Coarse Network Behaviors
A user who wants to use a service forbidden by their site's usage policy can masquerade their packets in order to evade detection. One masquerade technique sends prohibited tr...
Michael P. Collins, Michael K. Reiter
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
COMCOM
2006
56views more  COMCOM 2006»
13 years 8 months ago
Retransmission policies for multihomed transport protocols
Abstract-- We evaluate three retransmission policies for transport protocols that support multihoming (e.g., SCTP). The policies dictate whether retransmissions are sent to the sam...
Armando L. Caro Jr., Paul D. Amer, Randall R. Stew...

Publication
222views
14 years 5 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
HIPC
2007
Springer
14 years 12 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri