461 search results - page 30 / 93 » Splitting NP-Complete Sets |
CIMCA
2005
IEEE
14 years 4 months ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
ISPA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. A loop with irregular assignment computations contains loopcarried output data dependences that can only be detected at run-time. In this paper, a load-balanced method ba...
DAC
1999
ACM
14 years 3 months ago
1999
ACM
Abstract We describe the use of parametric representations of Boolean predicates to encode data-space constraints and signi cantly extend the capacity of formal veri cation. The co...
ENTCS
2007
13 years 11 months ago
2007
We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic “mother pipeline” machine (MOP) that abstracts the instruction set archite...
LMCS
2006
13 years 11 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...