6105 search results - page 784 / 1221 » A Parallel Algorithm for Bound-Smoothing |
177
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
140
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
171
Voted
ICS
1994
Tsinghua U.
15 years 11 months ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
197
click to vote
ICDCS
1992
IEEE
15 years 11 months ago
1992
IEEE
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
242
click to vote
GPC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...