2237 search results - page 274 / 448 » On the Security of Random Sources |
182
Voted
FLAIRS
2007
15 years 8 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
158
click to vote
WSC
2007
15 years 8 months ago
2007
The C source code associated with the Simulation 101 preconference workshop (offered at the 2006 and 2007 Winter Simulation Conferences) is presented here. This paper begins with ...
181
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a po...
161
click to vote
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
181
click to vote
ICC
2009
IEEE
15 years 3 months ago
2009
IEEE
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...