Sciweavers

1282 search results - page 99 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
115
Voted
EVOW
2007
Springer
15 years 8 months ago
An Adaptive Global-Local Memetic Algorithm to Discover Resources in P2P Networks
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
Ferrante Neri, Niko Kotilainen, Mikko Vapa
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
15 years 9 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
118
Voted
BMCBI
2002
100views more  BMCBI 2002»
15 years 2 months ago
An algorithm and program for finding sequence specific oligo-nucleotide probes for species identification
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...
Alexander E. Pozhitkov, Diethard Tautz
JCO
2010
182views more  JCO 2010»
15 years 23 days ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
129
Voted
EVOW
2007
Springer
15 years 6 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...