2766 search results - page 327 / 554 » Algorithms for trigonometric polynomials |
171
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...
182
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
170
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
174
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
160
click to vote
SAC
1997
ACM
15 years 10 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...