Sciweavers

14190 search results - page 394 / 2838
» compute 2008
Sort
View
WCNC
2008
IEEE
16 years 2 months ago
Computing TCP Throughput in a UMTS Network
— We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separa...
Kunde Anand, Vinod Sharma
AAAI
2008
15 years 8 months ago
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...
Fangzhen Lin, Pingzhong Tang
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
15 years 7 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
TPDS
2008
113views more  TPDS 2008»
15 years 7 months ago
Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
Abdallah Al Zain, Philip W. Trinder, Greg Michaels...