Sciweavers

157 search results - page 12 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
AINA
2008
IEEE
15 years 4 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
JCO
1998
136views more  JCO 1998»
14 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
RSA
2008
103views more  RSA 2008»
14 years 9 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
75
Voted
APVIS
2008
14 years 11 months ago
Illustrative Streamline Placement and Visualization
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...
Liya Li, Hsien-Hsi Hsieh, Han-Wei Shen
TSP
2008
150views more  TSP 2008»
14 years 9 months ago
Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks
This study examines the problem of target detection by a wireless sensor network. Sensors acquire measurements emitted from the target that are corrupted by noise and initially ma...
Natallia Katenka, Elizaveta Levina, George Michail...