Sciweavers

25167 search results - page 98 / 5034
» Parallel and Distributed Algorithms
Sort
View
HIPC
2003
Springer
15 years 3 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
IPPS
1999
IEEE
15 years 2 months ago
Distributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
Franciszek Seredynski, Jacek Koronacki, Cezary Z. ...
IPPS
2007
IEEE
15 years 4 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
IJFCS
2006
63views more  IJFCS 2006»
14 years 9 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
DCOSS
2006
Springer
15 years 1 months ago
The Robustness of Localization Algorithms to Signal Strength Attacks: A Comparative Study
In this paper, we examine several localization algorithms and evaluate their robustness to attacks where an adversary attenuates or amplifies the signal strength at one or more lan...
Yingying Chen, Konstantinos Kleisouris, Xiaoyan Li...