5115 search results - page 751 / 1023 » On Randomized Lanczos Algorithms |
158
click to vote
GECCO
2005
Springer
16 years 6 hour ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
149
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
175
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
195
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...