Sciweavers

1806 search results - page 169 / 362
» Randomness and halting probabilities
Sort
View
JDCTA
2008
88views more  JDCTA 2008»
13 years 10 months ago
A Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN
In WSNs, since the attacks, such as jamming or eavesdropping without physical access, easily occur, security is one of the important requirements for WSNs. The key pre-distributio...
Yoon-Su Jeong, Yong-Tae Kim, Gil-Cheol Park, Sang ...
SIAMJO
2008
72views more  SIAMJO 2008»
13 years 10 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 8 months ago
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
Yuxin Chen, Jeffrey Andrews
NLP
2000
14 years 1 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman