515 search results - page 61 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
TPDS
2010
13 years 6 months ago
2010
—We propose FIT, a flexible, lightweight, and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hierarchical...
ICFCA
2007
Springer
14 years 2 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
JASIS
2007
13 years 8 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
ACMSE
2006
ACM
14 years 2 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
CL
2004
Springer
13 years 8 months ago
2004
Springer
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...