2252 search results - page 145 / 451 » Lower Bounds for Dynamic Algorithms |
138
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
116
Voted
SIAMCO
2010
15 years 1 months ago
2010
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
119
Voted
WDAG
1990
Springer
15 years 7 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
115
Voted
ASIAN
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space ...
152
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...