Sciweavers

12052 search results - page 671 / 2411
» computing 2010
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 2 months ago
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
Leonid Barenboim, Michael Elkin
MOC
2010
15 years 2 months ago
Discontinuous Galerkin approximations of the Stokes and Navier-Stokes equations
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
Konstantinos Chrysafinos, Noel Walkington
TCIAIG
2010
15 years 1 months ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
CCR
2010
132views more  CCR 2010»
15 years 4 months ago
Scafida: a scale-free network inspired data center architecture
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
László Gyarmati, Tuan Anh Trinh
DAM
2010
105views more  DAM 2010»
15 years 4 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...