Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

70

Voted

JISE
2010

66views more JISE 2010»

Testing Whether a Set of Code Words Satisfies a Given Set of Constraints

14 years 9 months ago

Testing Whether a Set of Code Words Satisfies a Given Set of Constraints

Download www.iis.sinica.edu.tw

Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuen

Real-time Traffic

JISE 2010 |

claim paper

Related Content

» Constructing small sample spaces satisfying given constraints

» Improving platformbased system synthesis by satisfiability modulo theories solving

» Randomized Fast Design of Short DNA Words

» Narrowing the Gap between SetConstraints and CLPSETConstraints

» On the Satisfiability of Complex Constraints

» Improving solver success in reaching feasibility for sets of nonlinear constraints

» Computational properties of argument systems satisfying graphtheoretic constraints

» Efficient feasibility testing for dialaride problems

» Filtering Unsatisfiable XPATH Queries

Post Info
More Details (n/a)

Added	19 May 2011
Updated	19 May 2011
Type	Journal
Year	2010
Where	JISE
Authors	Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuen Shih, Ming-Yang Kao

Comments (0)