Sciweavers

14158 search results - page 328 / 2832
» Generalized switch-setting problems
Sort
View
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 5 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
146
Voted
CCR
2005
129views more  CCR 2005»
15 years 4 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 4 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 4 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 11 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke