Sciweavers

6542 search results - page 346 / 1309
» The tao of parallelism in algorithms
Sort
View
189
Voted
IPPS
2007
IEEE
16 years 1 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
179
Voted
IPPS
2007
IEEE
16 years 1 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
196
Voted
HPCC
2007
Springer
16 years 1 months ago
Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
Bo Li, Dongfeng Zhao
191
Voted
IPPS
2007
IEEE
16 years 1 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
227
Voted
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 9 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh