137 search results - page 13 / 28 » Understanding Parallel Repetition Requires Understanding Foa... |
ICDCSW
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
ISPDC
2006
IEEE
14 years 2 months ago
2006
IEEE
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
IEEEPACT
2003
IEEE
14 years 1 months ago
2003
IEEE
Improving cache performance requires understanding cache behavior. However, measuring cache performance for one or two data input sets provides little insight into how cache behav...
FLAIRS
2001
13 years 10 months ago
2001
Discrete optimization problemsarise throughout many real world domainsincluding planning, decision making, and search. NP-hardin general, these problems require novel approachesto...
IJCAI
1989
13 years 9 months ago
1989
Most implementations of AND-parallelism tackle the shared variable problem by running literals in parallel only if they have no variables in common and thus are independent from e...