927 search results - page 37 / 186 » A comparison of two approaches to pseudorandomness |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
When using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his c...
BMCBI
2005
14 years 9 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
83
Voted
AAAI
2008
14 years 12 months ago
2008
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...