Sciweavers

2663 search results - page 226 / 533
» How to Choose a Timing Model
Sort
View
SIGMETRICS
2004
ACM
105views Hardware» more  SIGMETRICS 2004»
15 years 9 months ago
A model of BGP routing for network engineering
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
Nick Feamster, Jared Winick, Jennifer Rexford
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 5 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
RECSYS
2010
ACM
15 years 4 months ago
Affiliation recommendation using auxiliary networks
Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links amongst users, the phenomenon of users associating th...
Vishvas Vasuki, Nagarajan Natarajan, Zhengdong Lu,...
BMCBI
2010
88views more  BMCBI 2010»
15 years 4 months ago
Robust probabilistic superposition and comparison of protein structures
Background: Protein structure comparison is a central issue in structural bioinformatics. The standard dissimilarity measure for protein structures is the root mean square deviati...
Martin Mechelke, Michael Habeck
JMLR
2008
159views more  JMLR 2008»
15 years 4 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin