WEA
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
WEA
2004
Springer
14 years 5 months ago
2004
Springer
WEA
2004
Springer
14 years 5 months ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
WEA
2004
Springer
14 years 5 months ago
2004
Springer
WEA
2004
Springer
14 years 5 months ago
2004
Springer
Clustering can be used to identify groups of similar solutions in Multimodal Optimisation. However, a poor clustering quality reduces the benefit of this application. The vast maj...
WEA
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
WEA
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
WDAG
2004
Springer
14 years 5 months ago
2004
Springer
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...