849 search results - page 35 / 170 » Network-Aware Distributed Computing: A Case Study |
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
HPCA
1997
IEEE
13 years 12 months ago
1997
IEEE
ÐIn this paper, we study distributed path reservation protocols for multiplexed all-optical interconnection networks. The path reservation protocols negotiate the reservation and ...
ALMOB
2006
13 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...