8728 search results - page 198 / 1746 » On Reduct Construction Algorithms |
136
click to vote
HICSS
1994
IEEE
15 years 10 months ago
1994
IEEE
The messiahs project is investigating mechanisms that support task placement in heterogeneous, distributed, autonomous systems. messiahs provides a substrate on which scheduling a...
167
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
156
click to vote
IJCAI
2003
15 years 8 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
154
click to vote
SCAM
2008
IEEE
16 years 27 days ago
2008
IEEE
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
148
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...