1333 search results - page 35 / 267 » Not a Number of Floating Point Problems |
126
click to vote
FFA
2008
15 years 3 months ago
2008
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
157
Voted
CATS
2008
15 years 4 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
135
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
144
click to vote
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— Consider a biped evolving in the sagittal plane. The unexpected rotation of the supporting foot can be avoided by controlling the zero moment point or ZMP. The objective of thi...
165
Voted
ALGORITHMICA
2004
15 years 3 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...