Sciweavers

Share
409 search results - page 1 / 82
» Maximal Completion
Sort
View
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
10 years 18 days ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
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...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
CADE
2015
Springer
4 years 2 months ago
Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion
Abstract. This paper describes two advancements of SAT-based KnuthBendix completion as implemented in Maxcomp. (1) Termination techniques using the dependency pair framework are en...
Haruhiko Sato, Sarah Winkler
RTA
2011
Springer
8 years 10 months ago
Maximal Completion
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...
Dominik Klein, Nao Hirokawa
RTSS
1994
IEEE
9 years 11 months ago
On-Line Scheduling to Maximize Task Completions
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 ...
Sanjoy K. Baruah, Jayant R. Haritsa, Nitin Sharma
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
9 years 11 months ago
Maximizing Job Completions Online
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...
Bala Kalyanasundaram, Kirk Pruhs
books