Sciweavers

358 search results - page 59 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
105
Voted
PODC
2004
ACM
15 years 7 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 8 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
126
Voted
PAMI
2008
145views more  PAMI 2008»
15 years 1 months ago
Latent-Space Variational Bayes
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
JaeMo Sung, Zoubin Ghahramani, Sung Yang Bang
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
15 years 8 months ago
Evolution of functional specialization in a morphologically homogeneous robot
A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent’s body, brain and environment. It follows t...
Joshua S. Auerbach, Josh C. Bongard
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 7 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...