2974 search results - page 210 / 595 » Model-Driven Constraint Programming |
269
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
163
click to vote
ICTAI
2008
IEEE
16 years 28 days ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
188
click to vote
DATE
2007
IEEE
16 years 25 days ago
2007
IEEE
We present a methodology for generating optimized architectures for data bandwidth constrained extensible processors. We describe a scalable Integer Linear Programming (ILP) formu...
195
click to vote
SAS
1994
Springer
15 years 10 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
149
click to vote
UIST
1994
ACM
15 years 10 months ago
1994
ACM
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...