Sciweavers

8125 search results - page 1243 / 1625
» Parallelism and evolutionary algorithms
Sort
View
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
16 years 1 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
CLUSTER
2007
IEEE
16 years 1 months ago
Network performance model for TCP/IP based cluster computing
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
Akihiro Nomura, Hiroya Matsuba, Yutaka Ishikawa
KBSE
2007
IEEE
16 years 1 months ago
Diconic addition of failsafe fault-tolerance
We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its...
Ali Ebnenasir
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
16 years 27 days ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
EUROPAR
2007
Springer
16 years 27 days ago
Periodic Load Balancing on the N -Cycle: Analytical and Experimental Evaluation
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
Christian Rieß, Rolf Wanka
« Prev « First page 1243 / 1625 Last » Next »