Sciweavers

779 search results - page 92 / 156
» Spectral Generative Models for Graphs
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 2 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
ISPA
2004
Springer
14 years 1 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
WSC
2004
13 years 10 months ago
The Potential Coupling Interface: Metadata for Model Coupling
Model coupling is a nontrivial task that is not adequately supported in existing frameworks. Our long term goal is to support the fast-prototyping of model couplings, enabling sci...
Tom Bulatewicz, Janice E. Cuny, Maureen Warman
COMPLEX
2009
Springer
14 years 13 days ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan