3758 search results - page 159 / 752 » A Complete Subsumption Algorithm |
EMISA
2002
Springer
14 years 9 months ago
2002
Springer
Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...
RSA
2002
14 years 9 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
WSS
2001
14 years 11 months ago
2001
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...
ASIACRYPT
2003
Springer
15 years 3 months ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
SECON
2007
IEEE
15 years 4 months ago
2007
IEEE
— In wireless sensor networks, it is desirable to maintain good sensing coverage while keeping the number of active sensor nodes small to achieve long system lifetime. Existing c...