1094 search results - page 108 / 219 » One Size Fits All |
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
IWDW
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we present a watermarking based approach, and its implementation, for mitigating phishing attacks - a form of web based identity theft. ViWiD is an integrity check m...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract. To achieve an efficient utilization of cluster systems, a proper programming and operating environment is required. In this context, mobile agents are of growing interes...
VTC
2010
IEEE
13 years 7 months ago
2010
IEEE
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...