31 search results - page 2 / 7 » Speeding up random walks with neighborhood exploration |
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
WSC
2008
13 years 7 months ago
2008
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
ENTCS
2008
13 years 5 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
RT
1998
Springer
13 years 9 months ago
1998
Springer
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
ASPDAC
2007
ACM
13 years 9 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...