Sciweavers

7930 search results - page 92 / 1586
» Greedy in Approximation Algorithms
Sort
View
EVOW
2005
Springer
15 years 11 months ago
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
Olfa Sammoud, Christine Solnon, Khaled Ghéd...
RECOMB
2010
Springer
15 years 8 months ago
Subnetwork State Functions Define Dysregulated Subnetworks in Cancer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
Salim A. Chowdhury, Rod K. Nibbe, Mark R. Chance, ...
INFOCOM
2010
IEEE
15 years 4 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
CPAIOR
2011
Springer
14 years 9 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
JSAC
2007
133views more  JSAC 2007»
15 years 6 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...