Sciweavers

4962 search results - page 475 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
IV
2002
IEEE
121views Visualization» more  IV 2002»
15 years 11 months ago
Visualising a Fund Manager Flow Graph with Columns and Worms
This paper describes a paradigm for visualising time deflow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We ...
Tim Dwyer, Peter Eades
ASYNC
2000
IEEE
145views Hardware» more  ASYNC 2000»
15 years 11 months ago
Practical Design of Globally-Asynchronous Locally-Synchronous Systems
In this paper we describe a complete design methodology for a globally asynchronous onchip communication network connecting both locally-synchronous and asynchronous modules. Sync...
Jens Muttersbach, Thomas Villiger, Wolfgang Fichtn...
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
15 years 11 months ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani
SIGCSE
2002
ACM
125views Education» more  SIGCSE 2002»
15 years 6 months ago
Small-college supercomputing: building a Beowulf cluster at a comprehensive college
A Beowulf cluster is a MIMD multiprocessor built from commodity off-the-shelf personal computers connected via a dedicated network, running free open-source software. Such a clust...
Joel C. Adams, David Vos
AAAI
2011
14 years 6 months ago
Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to nonbinary CSPs, and describe a...
Robert J. Woodward, Shant Karakashian, Berthe Y. C...