5115 search results - page 342 / 1023 » On Randomized Lanczos Algorithms |
204
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
215
click to vote
ICDCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
170
click to vote
AE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
231
click to vote
STACS
2005
Springer
16 years 26 days ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
216
click to vote
FSTTCS
2004
Springer
16 years 24 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...