Craft: a constraint-based random-number generator
نویسنده
چکیده
In this paper I describe Craft, a floating-point constraint solver that generates sets of random numbers satisfying designerspecified algebraic constraints. Craft is available both as a C# API and as a Unity3D component that allows designers to directly specify constraints in the Unity editor. Despite the exponential complexity of the algorithm, the algorithm performs well on design-inspired problems at realistic scales.
منابع مشابه
A uniform random test data generator for path testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test data that execute another control flow path). We address this problem with an original divide-and-c...
متن کاملA Path-oriented Automatic Random Testing Based on Double Constraint Propagation
A key issue in software testing is the actual generation of test data from program input domain. Obviously, more accurate input domain is, more efficient test generation is. This paper presents a path-oriented automatic random testing method based on double constraint propagation. For a given path, its domain can be reduced by splitting an input variable domain and executing a double constraint...
متن کاملA Generator for Random Non-Binary Finite Constraint Satisfaction Problems
The paper describes an implementation of a generator of random instances of non-binary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in [1]. 1 Description The program is designed to generate random instances of Constraint Satisfaction Problems (CSPs) that meet a set of specified parameters, such as the number of variable...
متن کاملFurther Progress on the GM-MDS Conjecture for Reed-Solomon Codes
Abstract—Designing good error correcting codes whose generator matrix has a support constraint, i.e., one for which only certain entries of the generator matrix are allowed to be nonzero, has found many recent applications, including in distributed coding and storage, multiple access networks, and weakly secure data exchange. The dual problem, where the parity check matrix has a support constra...
متن کاملOn Generators of Random Quasigroup Problems
Random problems are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representative of structured random problems that are closer to real-life problems. In this paper, we study generators for Quasigroup Completion Problem (QCP) and Quasigroups with Holes (QWH). We propose an improvement of the generator for QCP that produces a lar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015