Sciweavers

5580 search results - page 35 / 1116
» Randomized priority algorithms
Sort
View
ICPP
1998
IEEE
15 years 1 months ago
A Real-Time Communication Method for Wormhole Switching Networks
In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communicat...
Byungjae Kim, Jong Kim, Sung Je Hong, Sunggu Lee
COMCOM
2004
96views more  COMCOM 2004»
14 years 9 months ago
Achieving proportional delay differentiation efficiently
In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model (PDM) first proposed under the Dif...
Hoon-Tong Ngin, Chen-Khong Tham
83
Voted
ICRA
2009
IEEE
103views Robotics» more  ICRA 2009»
14 years 7 months ago
Prioritizing linear equality and inequality systems: Application to local motion planning for redundant robots
We present a novel method for prioritizing both linear equality and inequality systems and provide one algorithm for its resolution. This algorithm can be summarized as a sequence ...
Oussama Kanoun, Florent Lamiraux, Pierre-Brice Wie...
MCU
2004
95views Hardware» more  MCU 2004»
14 years 11 months ago
Algorithmic Randomness, Quantum Physics, and Incompleteness
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
RSA
2008
78views more  RSA 2008»
14 years 9 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák