243 search results - page 40 / 49 » On Balanced Graphs |
113
click to vote
MSWIM
2006
ACM
15 years 3 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
IEEEPACT
2005
IEEE
15 years 3 months ago
2005
IEEE
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
PACT
2009
Springer
15 years 2 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...