392 search results - page 1 / 79 » Maximal Completion |
PKDD
2005
Springer
13 years 10 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
RTA
2011
Springer
12 years 7 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
RTSS
1994
IEEE
13 years 9 months ago
1994
IEEE
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
ESA
1998
Springer
13 years 9 months ago
1998
Springer
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
BIOINFORMATICS
1999
13 years 4 months ago
1999
