Sciweavers

25167 search results - page 286 / 5034
» Parallel and Distributed Algorithms
Sort
View
WSC
2007
15 years 9 months ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
ICDCS
2009
IEEE
16 years 1 months ago
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
Massive collaborative editing becomes a reality through leading projects such as Wikipedia. This massive collaboration is currently supported with a costly central service. In ord...
Stéphane Weiss, Pascal Urso, Pascal Molli
IPPS
2007
IEEE
16 years 29 days ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
PDP
2008
IEEE
16 years 1 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
HIPC
2007
Springer
16 years 25 days ago
Multi-objective Peer-to-Peer Neighbor-Selection Strategy Using Genetic Algorithm
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...
Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo ...