753 search results - page 8 / 151 » Completing a (k - 1)-Assignment |
117
click to vote
IPL
2006
15 years 3 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
124
Voted
SDM
2009
SIAM
16 years 28 days ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
115
Voted
DAM
2008
15 years 3 months ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
117
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
133
Voted
RTSS
1994
IEEE
15 years 7 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 ...