Sciweavers

5183 search results - page 593 / 1037
» The Complexity of Distributions
Sort
View
COMCOM
2010
112views more  COMCOM 2010»
15 years 7 months ago
Birkhoff-von Neumann switching with statistical traffic profiles
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
Jerry Chi-Yuan Chou, Bill Lin
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 7 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
CVGIP
2010
182views more  CVGIP 2010»
15 years 7 months ago
MCCD: Multi-core collision detection between deformable models using front-based decomposition
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
Min Tang, Dinesh Manocha, Ruofeng Tong
ENTCS
2010
82views more  ENTCS 2010»
15 years 7 months ago
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
Philip Mayer, Andreas Schroeder, Sebastian S. Baue...
ENTCS
2008
99views more  ENTCS 2008»
15 years 7 months ago
Modelling Intracellular Fate of FGF Receptors With BioAmbients
In this paper we consider a model of different sorting of receptors for Fibroblast Growth Factor via the endocytotic pathway. In order to accurately model the relocation in the di...
Steffen van Bakel, Ikra Khan, Maria Grazia Vigliot...