Sciweavers

819 search results - page 114 / 164
» Parallelization with Tree Skeletons
Sort
View
FSTTCS
1995
Springer
15 years 1 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
DCOSS
2010
Springer
15 years 1 months ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas
DATAMINE
2002
125views more  DATAMINE 2002»
14 years 9 months ago
High-Performance Commercial Data Mining: A Multistrategy Machine Learning Application
We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and c...
William H. Hsu, Michael Welge, Thomas Redman, Davi...
CLUSTER
1998
IEEE
14 years 9 months ago
Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks
In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast pac...
Ching-Chuan Chiang, Mario Gerla, Lixia Zhang
TPDS
2010
144views more  TPDS 2010»
14 years 8 months ago
Performance Evaluation of Dynamic Speculative Multithreading with the Cascadia Architecture
—Thread-level parallelism (TLP) has been extensively studied in order to overcome the limitations of exploiting instruction-level parallelism (ILP) on high-performance superscala...
David A. Zier, Ben Lee