4117 search results - page 42 / 824 » On the Satisfiability of Complex Constraints |
KBSE
1997
IEEE
15 years 4 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
COLING
2008
15 years 1 months ago
2008
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
129
click to vote
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
100
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
DAC
2002
ACM
16 years 24 days ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...