We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
A number of network covert channels have been proposed recently that may have important ramifications for Internet security and privacy. However, they could become ineffective in...
A low-cost kit of stick-on wireless sensors that transmit data indicating whenever various objects are being touched or used might aid ubiquitous computing research efforts on rapi...
Emmanuel Munguia Tapia, Stephen S. Intille, Kent L...
A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartment...
Gul Muhammad Khan, Julian Francis Miller, David M....
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...