Sciweavers

5922 search results - page 875 / 1185
» Navigability of Complex Networks
Sort
View
AAAI
2010
15 years 8 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
AIPS
2010
15 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
CONEXT
2009
ACM
15 years 8 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
CN
2010
95views more  CN 2010»
15 years 7 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...
BMCBI
2005
124views more  BMCBI 2005»
15 years 7 months ago
Tools enabling the elucidation of molecular pathways active in human disease: Application to Hepatitis C virus infection
Background: The extraction of biological knowledge from genome-scale data sets requires its analysis in the context of additional biological information. The importance of integra...
David J. Reiss, Iliana Avila-Campillo, Vesteinn Th...