Sciweavers

12950 search results - page 86 / 2590
» On Optimal Timed Strategies
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 2 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ENDM
2010
105views more  ENDM 2010»
13 years 10 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
HM
2007
Springer
162views Optimization» more  HM 2007»
14 years 4 months ago
Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
Prasanna Balaprakash, Mauro Birattari, Thomas St&u...
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
14 years 3 months ago
A mutation operator for evolution strategies to handle constrained problems
Oliver Kramer, Chuan-Kang Ting, Hans Kleine Bü...