Sciweavers

463 search results - page 24 / 93
» The Most Reliable Subgraph Problem
Sort
View
109
Voted
IJCBDD
2010
127views more  IJCBDD 2010»
15 years 9 days ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...
122
Voted
WWW
2011
ACM
14 years 8 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
TAMC
2009
Springer
15 years 8 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
125
Voted
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 5 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
CISS
2008
IEEE
15 years 8 months ago
The Chinese Generals Problem
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
Edwin Soedarmadji