Sciweavers

513 search results - page 55 / 103
» A Cost Benefit Model for Dynamic Resource Sharing
Sort
View
169
Voted
CEC
2005
IEEE
15 years 11 months ago
CasGP: building cascaded hierarchical models using niching
— A Cascaded model is introduced for mining large datasets using Genetic Programming without recourse to specialist hardware. Such an algorithm satisfies the seeming conflictin...
Peter Lichodzijewski, Malcolm I. Heywood, A. Nur Z...
TON
2008
88views more  TON 2008»
15 years 6 months ago
Traffic modeling and proportional partial caching for peer-to-peer systems
Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected to increase in the future. We explore the potential of deploy...
Mohamed Hefeeda, Osama Saleh
SENSYS
2006
ACM
16 years 1 days ago
Run-time dynamic linking for reprogramming wireless sensor networks
From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energ...
Adam Dunkels, Niclas Finne, Joakim Eriksson, Thiem...
INFOCOM
1995
IEEE
15 years 9 months ago
Virtual Path Bandwidth Allocation in Multi-User Networks
— We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure account...
Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendaraki...
GLOBECOM
2006
IEEE
16 years 4 days ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang