537 search results - page 100 / 108 » A new upper bound for 3-SAT |
AIPS
2006
13 years 9 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
ADHOC
2006
13 years 8 months ago
2006
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
LATINCRYPT
2010
13 years 6 months ago
2010
Abstract. In this paper, we present an efficient cryptanalysis of the socalled HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, ...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...