2252 search results - page 324 / 451 » Lower Bounds for Dynamic Algorithms |
118
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
130
click to vote
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
115
click to vote
SRDS
1999
IEEE
15 years 7 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
122
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
140
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...