Sciweavers

1017 search results - page 23 / 204
» Some existence and construction results of polygonal designs
Sort
View
IJAIT
2002
81views more  IJAIT 2002»
13 years 7 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
TCAD
2008
195views more  TCAD 2008»
13 years 7 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...
INFOCOM
2010
IEEE
13 years 5 months ago
Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks
Abstract—Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distanc...
Yun Wang, Kai Li, Jie Wu
SMA
2006
ACM
121views Solid Modeling» more  SMA 2006»
14 years 1 months ago
Duplicate-skins for compatible mesh modelling
As compatible meshes play important roles in many computeraided design applications, we present a new approach for modelling compatible meshes. Our compatible mesh modelling metho...
Yu Wang, Charlie C. L. Wang, Matthew Ming-Fai Yuen
TCAD
2008
128views more  TCAD 2008»
13 years 7 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...