Sciweavers

3838 search results - page 442 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
CVGIP
2004
175views more  CVGIP 2004»
15 years 6 months ago
A subdivision-based deformable model for surface reconstruction of unknown topology
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
Ye Duan, Hong Qin
PE
2011
Springer
274views Optimization» more  PE 2011»
15 years 1 months ago
A generalized method of moments for closed queueing networks
We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several o...
Giuliano Casale
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 10 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
15 years 11 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
DAC
2010
ACM
15 years 10 months ago
PreDVS: preemptive dynamic voltage scaling for real-time systems using approximation scheme
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
Weixun Wang, Prabhat Mishra