7930 search results - page 668 / 1586 » Greedy in Approximation Algorithms |
191
Voted
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
187
Voted
IJCNN
2006
IEEE
16 years 1 months ago
2006
IEEE
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
212
Voted
CP
2004
Springer
16 years 21 days ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
170
Voted
SWAT
2004
Springer
16 years 19 days ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
305
Voted
VISUALIZATION
2002
IEEE
16 years 6 days ago
2002
IEEE
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...