Sciweavers

4377 search results - page 165 / 876
» Mass problems and randomness
Sort
View
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
16 years 3 months ago
Stimulus generation for constrained random simulation
Constrained random simulation is the main workhorse in today’s hardware verification flows. It requires the random generation of input stimuli that obey a set of declaratively...
Nathan Kitchen, Andreas Kuehlmann
COMPSAC
2008
IEEE
16 years 1 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
16 years 1 days ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
IPPS
1998
IEEE
15 years 10 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
ICIAR
2007
Springer
15 years 10 months ago
Processing Random Amplified Polymorphysm DNA Images Using the Radon Transform and Mathematical Morphology
Abstract. Random Amplified Polymorphism DNA (RAPD) analysis is a wellknown method for studying genetic relationships between individuals. In this context, processing the underlying...
Luis Rueda, Omar Uyarte, Sofia Valenzuela, Jaime R...