3247 search results - page 184 / 650 » Randomized smoothing networks |
141
click to vote
FSTTCS
1995
Springer
15 years 8 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
141
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
126
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
127
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
134
click to vote
ICAI
2003
15 years 5 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...