3267 search results - page 423 / 654 » Generalized quasirandom graphs |
179
click to vote
CLUSTER
2006
IEEE
15 years 6 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
176
click to vote
EAAI
2007
15 years 6 months ago
2007
Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspec...
165
click to vote
ENDM
2007
15 years 6 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
169
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
182
click to vote
JUCS
2006
15 years 6 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...