Sciweavers

4451 search results - page 44 / 891
» On Random Ordering Constraints
Sort
View
CAEPIA
2003
Springer
15 years 5 months ago
Distributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
Miguel A. Salido, Federico Barber
JCB
2006
124views more  JCB 2006»
14 years 11 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
MODELS
2009
Springer
15 years 6 months ago
On Better Understanding OCL Collections or An OCL Ordered Set Is Not an OCL Set
Abstract. Modeling languages like UML or EMF support textual constraints written in OCL. OCL allows the developer to use various collec
Fabian Büttner, Martin Gogolla, Lars Hamann, ...
ICALP
2005
Springer
15 years 5 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
15 years 8 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