Sciweavers

2913 search results - page 46 / 583
» How Much to Copy
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
IMC
2010
ACM
13 years 5 months ago
The effect of packet loss on redundancy elimination in cellular wireless networks
Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous...
Cristian Lumezanu, Katherine Guo, Neil Spring, Bob...
SPAA
2009
ACM
14 years 4 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
WCNC
2008
IEEE
14 years 2 months ago
Performance Improvement for Multichannel HARQ Protocol in Next Generation WiMAX System
Hybrid automatic repeat-request (HARQ) is critical to an IEEE 802.16e OFDMA network, as it can significantly improve the reliability of wireless link. However, as revealed by our...
Zhifeng Tao, Anfei Li, Jinyun Zhang, Toshiyuki Kuz...
EMSOFT
2006
Springer
13 years 11 months ago
Reliability mechanisms for file systems using non-volatile memory as a metadata store
Portable systems such as cell phones and portable media players commonly use non-volatile RAM (NVRAM) to hold all of their data and metadata, and larger systems can store metadata...
Kevin M. Greenan, Ethan L. Miller