5115 search results - page 70 / 1023 » On Randomized Lanczos Algorithms |
CEC
2007
IEEE
15 years 1 months ago
2007
IEEE
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
100
click to vote
ICOIN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...