Sciweavers

653 search results - page 68 / 131
» The size of minimum 3-trees
Sort
View
ASPDAC
2006
ACM
146views Hardware» more  ASPDAC 2006»
16 years 9 days ago
A fixed-die floorplanning algorithm using an analytical approach
— Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the t...
Yong Zhan, Yan Feng, Sachin S. Sapatnekar
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
15 years 12 months ago
Adaptive Control of Hydraulic Systems with MML Inferred RBF Networks
— In this paper the problem of adaptively controlling a hydraulic system with uncertainties is considered. An adaptive controller is derived to control actuator force with unknow...
Daniel F. Schmidt, Andrew P. Paplinski, Gordon S. ...
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
15 years 12 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
ICALP
2005
Springer
15 years 12 months ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....
SPAA
2004
ACM
15 years 11 months ago
Balanced graph partitioning
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
Konstantin Andreev, Harald Räcke