Sciweavers

145 search results - page 3 / 29
» On finding approximate optimal paths in weighted regions
Sort
View
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
13 years 12 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
13 years 9 months ago
Fitness function for finding out robust solutions on time-varying functions
Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, ...
Hisashi Handa
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
13 years 7 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
13 years 11 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
FCT
2007
Springer
13 years 9 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...