Sciweavers

76 search results - page 13 / 16
» isaac 2005
Sort
View
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
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...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Network Game with Attacker and Protector Entities
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...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
ISAAC
2005
Springer
76views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Improved Algorithms for the k Maximum-Sums Problems
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...
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Shifting Strategy for Geometric Graphs without Geometry
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 ...
Imran A. Pirwani
INFOCOM
2005
IEEE
14 years 3 months ago
Optimal load-balancing
— 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...
Isaac Keslassy, Cheng-Shang Chang, Nick McKeown, D...