1469 search results - page 211 / 294 » Approximate polynomial decomposition |
165
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
134
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
— The high-order compact finite difference (HCFD) method is adapted for interconnect modeling. Based on the compact finite difference method, the HCFD method employs the Chebys...
167
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
146
click to vote
ASAP
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents an e cient hardware algorithm for variable-precision logarithm. The algorithm uses an iterative te chnique that employs table lookups and polynomial approximat...
147
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...