Sciweavers

3958 search results - page 118 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 11 months ago
Dynamic optimization of migration topology in internet-based distributed genetic algorithms
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
Johan Berntsson, Maolin Tang
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 6 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
PDP
2008
IEEE
16 years 12 days ago
QoS-constrained List Scheduling Heuristics for Parallel Applications on Grids
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...
Nicola Tonellotto, Ranieri Baraglia, Renato Ferrin...
SDM
2009
SIAM
113views Data Mining» more  SDM 2009»
16 years 3 months ago
Graph Generation with Prescribed Feature Constraints.
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
Xiaowei Ying, Xintao Wu
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
15 years 7 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...