Sciweavers

5448 search results - page 42 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
NIPS
2007
15 years 1 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
202
Voted
APDC
1997
15 years 1 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
138
Voted
AIR
2005
130views more  AIR 2005»
15 years 11 days ago
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynam...
Andrew J. Page, Thomas J. Naughton
FTDCS
1997
IEEE
15 years 4 months ago
A Scheduling Algorithm for Aperiodic Groups of Tasks in Distributed Real-Time Systems and its Holistic Analysis
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
Paolo Bizzarri, Andrea Bondavalli, Felicita Di Gia...
ICC
2009
IEEE
120views Communications» more  ICC 2009»
15 years 7 months ago
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
Soung Chang Liew, Caihong Kai, Jason Leung, Bill W...