1333 search results - page 101 / 267 » Not a Number of Floating Point Problems |
143
click to vote
SSD
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
114
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
111
click to vote
EOR
2006
15 years 3 months ago
2006
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
122
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
ICCSA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present a nonlinear programming solution to one of the most challenging problems in trajectory optimization. Unlike most aerospace trajectory optimization problems...