Sciweavers

433 search results - page 85 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
EUROCRYPT
2008
Springer
14 years 11 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
ATAL
2010
Springer
14 years 10 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
CORR
2006
Springer
145views Education» more  CORR 2006»
14 years 9 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
97
Voted
INFOCOM
1998
IEEE
15 years 1 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan