Sciweavers

1534 search results - page 190 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
DC
2010
13 years 10 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
EUROPAR
2010
Springer
13 years 11 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li
CEC
2008
IEEE
14 years 4 months ago
Generating massive high-quality random numbers using GPU
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng
ICPADS
2006
IEEE
14 years 4 months ago
SPM Conscious Loop Scheduling for Embedded Chip Multiprocessors
One of the major factors that can potentially slow down widespread use of embedded chip multiprocessors is lack of efficient software support. In particular, automated code paral...
Liping Xue, Mahmut T. Kandemir, Guangyu Chen, Tayl...
IPL
2002
90views more  IPL 2002»
13 years 10 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna