3758 search results - page 17 / 752 » A Complete Subsumption Algorithm |
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
ISPAN
1999
IEEE
13 years 11 months ago
1999
IEEE
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
JAIR
2008
13 years 7 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
AISC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
JAIR
2007
13 years 7 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...