Sciweavers

1095 search results - page 203 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
14 years 1 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
ISPDC
2006
IEEE
14 years 1 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
CCGRID
2005
IEEE
14 years 1 months ago
A distributed resource and network partitioning architecture for service grids
Abstract In this paper, we propose the use of a distributed service management architecture for state-of-the-art service-enabled Grids. The architecture is capable of performing au...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
ICRA
2005
IEEE
119views Robotics» more  ICRA 2005»
14 years 1 months ago
Comparison of Alternate Methods for Distributed Motion Planning of Robot Collectives within a Potential Field Framework
– In this paper, we evaluate the performance of two candidate formulations for distributed motion planning of robot collectives within an Artificial Potential Field (APF) framewo...
Leng-Feng Lee, Rajankumar Bhatt, Venkat Krovi