Sciweavers

6897 search results - page 631 / 1380
» Parallelization of Modular Algorithms
Sort
View
206
Voted
DSN
2003
IEEE
16 years 1 hour ago
An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, ...
ECCV
2010
Springer
15 years 12 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
ICPP
2002
IEEE
15 years 11 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran
SAC
1998
ACM
15 years 11 months ago
Scalability of an MPI-based fast messy genetic algorithm
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....
Laurence D. Merkle, George H. Gates Jr., Gary B. L...
COCOON
2007
Springer
15 years 10 months ago
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
George Christodoulou, Laurent Gourvès, Fann...