Sciweavers

2745 search results - page 394 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
165
Voted
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 11 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
PAM
2009
Springer
15 years 11 months ago
Revisiting Route Caching: The World Should Be Flat
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
Changhoon Kim, Matthew Caesar, Alexandre Gerber, J...
WWW
2003
ACM
15 years 10 months ago
Media Companion: Delivering Content-oriented Web Services to Internet Media
In the past few years we have seen a huge industrial investment on the development of content delivery networks (CDNs) which provide a large number of caches and storage devices a...
Wei-Ying Ma, Xing Xie, Chun Yuan, Yu Chen, Zheng Z...
EUROPAR
2009
Springer
15 years 9 months ago
SSD-HDD-Hybrid Virtual Disk in Consolidated Environments
Abstract. With the prevalence of multi-core processors and cloud computing, the server consolidation using virtualization has increasingly expanded its territory, and the degree of...
Heeseung Jo, Youngjin Kwon, Hwanju Kim, Euiseong S...
CLUSTER
2004
IEEE
15 years 8 months ago
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
Gengbin Zheng, Lixia Shi, Laxmikant V. Kalé