Sciweavers

332 search results - page 42 / 67
» Traveling salesman path problems
Sort
View
MICAI
2004
Springer
14 years 1 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
ASPDAC
1999
ACM
112views Hardware» more  ASPDAC 1999»
14 years 6 days ago
Relaxed Simulated Tempering for VLSI Floorplan Designs
In the past two decades, the simulated annealing technique has been considered as a powerful approach to handle many NP-hard optimization problems in VLSI designs. Recently, a new...
Jason Cong, Tianming Kong, Dongmin Xu, Faming Lian...
AINA
2010
IEEE
14 years 29 days ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
SSD
2005
Springer
145views Database» more  SSD 2005»
14 years 1 months ago
High Performance Multimodal Networks
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
JAT
2010
109views more  JAT 2010»
13 years 6 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi