76 search results - page 13 / 16 » isaac 2005 |
164
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
173
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
135
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
174
click to vote
ISAAC
2009
Springer
16 years 16 days ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
151
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper is about load-balancing packets across multiple paths inside a switch, or across a network. It is motivated by the recent interest in load-balanced switches. Load-ba...