1347 search results - page 9 / 270 » On the Structure of the Minimum Time Function |
JACM
2010
13 years 6 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
ASPDAC
2004
ACM
14 years 1 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
RTCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
Recent years, many efficient data dissemination protocols for mobile sinks in large scale sensor networks are currently under developed by researchers. In this paper we propose CO...