Sciweavers

1388 search results - page 46 / 278
» Approximability of Robust Network Design
Sort
View
ESA
2007
Springer
140views Algorithms» more  ESA 2007»
14 years 1 months ago
On Minimum Power Connectivity Problems
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
Yuval Lando, Zeev Nutov
MP
2006
101views more  MP 2006»
13 years 7 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 9 months ago
Designing a Super-Peer Network
A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a bala...
Beverly Yang, Hector Garcia-Molina
ESORICS
2009
Springer
14 years 2 months ago
Hide and Seek in Time - Robust Covert Timing Channels
Abstract. Covert timing channels aim at transmitting hidden messages by controlling the time between transmissions of consecutive payload packets in overt network communication. Pr...
Yali Liu, Dipak Ghosal, Frederik Armknecht, Ahmad-...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...