198 search results - page 31 / 40 » Colouring, constraint satisfaction, and complexity |
ENDM
2000
14 years 9 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
116
click to vote
PODS
1999
ACM
15 years 1 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
VLSID
2003
IEEE
15 years 9 months ago
2003
IEEE
A formal synthesis method for complex real-time embedded software is proposed in this work. Compared to previous work, our method not only synthesizes embedded software with compl...
CP
1998
Springer
15 years 1 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
KBSE
1997
IEEE
15 years 1 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...