Sciweavers

1511 search results - page 83 / 303
» On the effectiveness of address-space randomization
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
CN
2000
109views more  CN 2000»
13 years 7 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
ISPD
2000
ACM
124views Hardware» more  ISPD 2000»
14 years 7 days ago
A performance optimization method by gate sizing using statistical static timing analysis
We propose a gate resizing method for delay and power optimization that is based on statistical static timing analysis. Our method focuses on the component of timing uncertainties...
Masanori Hashimoto, Hidetoshi Onodera
DAC
1997
ACM
13 years 11 months ago
Technology-Dependent Transformations for Low-Power Synthesis
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...
Rajendran Panda, Farid N. Najm
AAAI
1994
13 years 9 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter