Sciweavers

987 search results - page 111 / 198
» Asynchronous parallel search by the parallel genetic algorit...
Sort
View
IPPS
2007
IEEE
14 years 3 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...
ASAP
2010
IEEE
185views Hardware» more  ASAP 2010»
13 years 9 months ago
ImpEDE: A multidimensional design-space exploration framework for biomedical-implant processors
Abstract—The demand for biomedical implants keeps increasing. However, most of the current implant design methodologies involve custom-ASIC design. The SiMS project aims to chang...
Dhara Dave, Christos Strydis, Georgi Gaydadjiev
PDP
2006
IEEE
14 years 3 months ago
A B2B Distributed Replication Service
A deadlock free distributed replication service for B2B CORBA based applications is presented. This service provides persistent storage for commercial transactions performed by B2...
José Javier Astrain, Alberto Córdoba...
ICDCS
2002
IEEE
14 years 1 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
ICDCN
2011
Springer
13 years 14 days ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...