2766 search results - page 167 / 554 » Algorithms for trigonometric polynomials |
171
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
176
click to vote
MLDM
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
137
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
113
click to vote
ASAP
2000
IEEE
15 years 8 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...
129
click to vote
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...