1275 search results - page 155 / 255 » time 1998 |
135
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
— This article describes an algorithm for curvilinear detailed routing. We significantly improved the average time performance of Gao’s algorithm by resolving its bottleneck r...
169
Voted
CHI
1998
ACM
15 years 10 months ago
1998
ACM
Writing scripts (often called “macros”) can be helpful for automating repetitive tasks. Scripting facilities for text editors like Emacs and Microsoft Word have been widely us...
147
click to vote
AMAST
1998
Springer
15 years 10 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
138
click to vote
ISPD
1998
ACM
15 years 10 months ago
1998
ACM
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop e cient wirelength estimation techniqu...
162
Voted
ATAL
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper, we consider the issue of designing agents that successfully balance the amount of time spent in reconsidering their intentions against the amount of time s...