Sciweavers

655 search results - page 114 / 131
» A clustering particle swarm optimizer for dynamic optimizati...
Sort
View
NSDI
2010
13 years 10 months ago
Hedera: Dynamic Flow Scheduling for Data Center Networks
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 3 months ago
Dynamic Micro Targeting: Fitness-Based Approach to Predicting Individual Preferences
It is crucial to segment customers intelligently in order to offer more targeted and personalized products and services. Traditionally, customer segmentation is achieved using sta...
Tianyi Jiang, Alexander Tuzhilin
ICDE
2010
IEEE
491views Database» more  ICDE 2010»
14 years 8 months ago
TrajStore: An Adaptive Storage System for Very Large Trajectory Data Sets
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Cu...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
CCGRID
2007
IEEE
14 years 3 months ago
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 8 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová