Sciweavers

14078 search results - page 276 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
ICS
2005
Tsinghua U.
16 years 4 days ago
Improving the computational intensity of unstructured mesh applications
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
Brian S. White, Sally A. McKee, Bronis R. de Supin...
CN
2004
109views more  CN 2004»
15 years 6 months ago
Modeling correlations in web traces and implications for designing replacement policies
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...
Konstantinos Psounis, An Zhu, Balaji Prabhakar, Ra...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 24 days ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
DAC
2003
ACM
16 years 7 months ago
Random walks in a supply network
This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transien...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar