Sciweavers

895 search results - page 100 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
IPPS
2010
IEEE
14 years 9 months ago
Efficient and scalable parallel reconstruction of sibling relationships from genetic data in wild populations
Wild populations of organism are often difficult to study in their natural settings. Often, it is possible to infer mating information about these species by genotyping the offspri...
Saad I. Sheikh, Ashfaq A. Khokhar, Tanya Y. Berger...
CIKM
2010
Springer
14 years 9 months ago
Mining topic-level influence in heterogeneous networks
Influence is a complex and subtle force that governs the dynamics of social networks as well as the behaviors of involved users. Understanding influence can benefit various applic...
Lu Liu, Jie Tang, Jiawei Han, Meng Jiang, Shiqiang...
INFOCOM
2003
IEEE
15 years 4 months ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 5 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
CVPR
2008
IEEE
16 years 1 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán