Sciweavers

2796 search results - page 199 / 560
» The coolest path problem
Sort
View
IJCGA
2010
86views more  IJCGA 2010»
15 years 5 months ago
Leaving an Unknown Maze Using an Error-Prone Compass
Imagine you are trapped in a maze of caves. All you have is an old rusty compass and barely enough light to read it. How much inaccuracy can you allow to ensure that you can leave...
Tom Kamphans, Elmar Langetepe
ICPP
2009
IEEE
15 years 4 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
ACSC
2010
IEEE
15 years 1 months ago
Average distance as a predictor of synchronisability in networks of coupled oscillators
The importance of networks of coupled oscillators is widely recognized. Such networks occur in biological systems like the heart, in chemical systems, in computational problems, a...
Anthony H. Dekker
ICC
2011
IEEE
217views Communications» more  ICC 2011»
14 years 6 months ago
A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
Xi Fang, Dejun Yang, Guoliang Xue
CORR
2012
Springer
210views Education» more  CORR 2012»
14 years 2 months ago
Fast MCMC sampling for Markov jump processes and continuous time Bayesian networks
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...
Vinayak Rao, Yee Whye Teh