245 search results - page 33 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
108
Voted
CADE
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
BMCBI
2006
14 years 11 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
118
click to vote
COMPSAC
2010
IEEE
14 years 9 months ago
2010
IEEE
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
CP
2003
Springer
15 years 5 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...