10608 search results - page 315 / 2122 » Complexity of O'Hara's Algorithm |
101
click to vote
TJS
2008
15 years 17 days ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
102
click to vote
MOC
1998
15 years 10 days ago
1998
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
140
Voted
OL
2011
14 years 7 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
79
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
The power consumption of video enabled mobile devices is an ongoing challenge. The computational burden caused by the motion estimation process involved in video compression is th...
109
click to vote
CONCUR
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...