Sciweavers

1986 search results - page 114 / 398
» constraints 2006
Sort
View
IANDC
2007
117views more  IANDC 2007»
13 years 7 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
DATE
2006
IEEE
124views Hardware» more  DATE 2006»
14 years 1 months ago
Timing-driven cell layout de-compaction for yield optimization by critical area minimization
This paper proposes a yield optimization method for standard-cells under timing constraints. Yield-aware logic synthesis and physical optimization require yield-enhanced standard ...
Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada
GMP
2006
IEEE
121views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Preserving Form-Features in Interactive Mesh Deformation
Interactive mesh editing techniques that preserve discrete differential properties are promising to support the design of mechanical parts such as automobile sheet metal panels. H...
Hiroshi Masuda, Yasuhiro Yoshioka, Yoshiyuki Furuk...
INFOCOM
2006
IEEE
14 years 1 months ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
CIT
2006
Springer
13 years 11 months ago
QoS Constrained Adaptive Routing Protocol For Mobile Adhoc Networks
The ease of deployment and the infrastructure less nature of Mobile Ad hoc Networks (MANETs) make them highly desirable for the present day multi media communications. Traditional ...
Vinod Kone, Sukumar Nandi