Sciweavers

334 search results - page 40 / 67
» Inapproximability of Survivable Networks
Sort
View
CISS
2007
IEEE
14 years 3 months ago
Bounding A Statistical Measure Of Network Lifetime For Wireless Sensor Networks
—The inherent many-to-one flow of traffic in Wireless Sensor Networks produces a skewed distribution of energy consumption rates leading to the early demise of those sensors that...
Muhammad Usman Ilyas, Hayder Radha
ACSAC
2001
IEEE
14 years 8 days ago
Mitigating Distributed Denial of Service Attacks with Dynamic Resource Pricing
Distributed Denial of Service (DDoS) attacks exploit the acute imbalance between client and server workloads to cause devastation to the service providers. We propose a distribute...
David Mankins, Rajesh Krishnan, Ceilyn Boyd, John ...
FUIN
2000
68views more  FUIN 2000»
13 years 8 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
IWANN
2007
Springer
14 years 2 months ago
Towards the Integration of a Bioprofile in Ocular Melanoma
Approximately 50% of all patients with intraocular melanoma die of metastatic disease, despite successful treatment of the primary tumour. The main factors associated with mortalit...
Azzam F. Taktak, Antonio Eleuteri, Christian Setzk...
EVOW
2001
Springer
14 years 1 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl