Sciweavers

1594 search results - page 197 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
DAM
2011
14 years 10 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
117
Voted
DAC
2006
ACM
16 years 4 months ago
A new LP based incremental timing driven placement for high performance designs
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
Tao Luo, David Newmark, David Z. Pan
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
15 years 10 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
169
Voted
ICRA
2006
IEEE
154views Robotics» more  ICRA 2006»
15 years 9 months ago
Qualitative Vision-based Mobile Robot Navigation
— We present a novel, simple algorithm for mobile robot navigation. Using a teach-replay approach, the robot is manually led along a desired path in a teaching phase, then the ro...
Zhichao Chen, Stanley T. Birchfield
ICN
2005
Springer
15 years 9 months ago
Stable Accurate Rapid Bandwidth Estimate for Improving TCP over Wireless Networks
Abstract. This paper presents a stable accurate rapid bandwidth estimate (SARBE) algorithm to improve TCP performance over wireless networks. The proposed algorithm estimates the b...
Le Tuan Anh, Choong Seon Hong