9842 search results - page 206 / 1969 » Problem complexity |
131
Voted
INFOSCALE
2007
ACM
15 years 4 months ago
2007
ACM
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
106
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
114
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
119
click to vote
ICNC
2009
Springer
15 years 9 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
121
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...