Sciweavers

4998 search results - page 268 / 1000
» The case for intentional networking
Sort
View
IPCO
2001
79views Optimization» more  IPCO 2001»
15 years 8 months ago
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
Refael Hassin, Asaf Levin
173
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
179
Voted
PERCOM
2004
ACM
16 years 6 months ago
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
Marco Mamei, Franco Zambonelli
IEEEARES
2008
IEEE
16 years 1 months ago
A Bayesian Approach for on-Line Max Auditing
In this paper we propose a method for on-line max auditing of dynamic statistical databases. The method extends the Bayesian approach presented in [2], [3] and [4] for static data...
Gerardo Canfora, Bice Cavallo
BROADNETS
2007
IEEE
16 years 1 months ago
Assessing discreet packet-dropping attacks using nearest-neighbor and path-vector attribution
— A Mobile Ad-Hoc Network (MANET) is considered with nodes that may act selfishly or maliciously by simply dropping data packets rather than forwarding them. We study a distribu...
Arnab Das 0002, George Kesidis, Venkat Pothamsetty