Sciweavers

1618 search results - page 115 / 324
» Testing random number generators
Sort
View
SAT
2004
Springer
102views Hardware» more  SAT 2004»
14 years 3 months ago
Derandomization of Schuler's Algorithm for SAT
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
Evgeny Dantsin, Alexander Wolpert
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
14 years 4 months ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull
WSC
2004
13 years 11 months ago
A Scenario Generation Tool for DDF Simulation Testbeds
An interactive tool has been developed for visualizing and creating scaled battlefield based scenarios for use in a simulation testbed to develop and test distributed data fusion ...
Govindarajan Srimathveeravalli, Navneeth Subramani...
SAS
2000
Springer
14 years 1 months ago
A Transformational Approach for Generating Non-linear Invariants
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
Saddek Bensalem, Marius Bozga, Jean-Claude Fernand...
ICCV
2003
IEEE
15 years 17 hour ago
A Multi-scale Generative Model for Animate Shapes and Parts
This paper presents a multi-scale generative model for representing animate shapes and extracting meaningful parts of objects. The model assumes that animate shapes (2D simple clo...
Aleksandr Dubinskiy, Song Chun Zhu