5606 search results - page 274 / 1122 » Randomization Techniques for Graphs. |
169
click to vote
IWSEC
2007
Springer
16 years 20 days ago
2007
Springer
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
160
click to vote
SAT
2005
Springer
15 years 12 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
171
click to vote
CA
2002
IEEE
15 years 11 months ago
2002
IEEE
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
166
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Previously either due to hardware GPU limits or older versions of software, careful implementation of PRNGs was required to make good use of the limited numerical precision availa...
171
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...