1963 search results - page 357 / 393 » The Maximum Solution Problem on Graphs |
173
click to vote
ESA
2007
Springer
16 years 3 days ago
2007
Springer
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...
140
click to vote
LADC
2007
Springer
16 years 3 days ago
2007
Springer
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
174
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
175
click to vote
DIALM
2007
ACM
15 years 10 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
181
click to vote
ACSAC
2010
IEEE
14 years 9 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...