497 search results - page 73 / 100 » On a Parallel Extended Euclidean Algorithm |
ICDCN
2011
Springer
12 years 11 months ago
2011
Springer
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 ...
EUROPAR
2001
Springer
14 years 8 days ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
SIAMCOMP
2010
13 years 6 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
FOCS
1998
IEEE
14 years 1 days ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...