Sciweavers

780 search results - page 24 / 156
» Cost-Sharing Approximations for h
Sort
View
PODS
2000
ACM
102views Database» more  PODS 2000»
13 years 11 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
FOCS
1998
IEEE
13 years 11 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
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...
Daniele Micciancio
ECML
2006
Springer
13 years 11 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
WSC
2004
13 years 8 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
IJCAI
1989
13 years 8 months ago
Approximation of Indistinct Concepts
This theory on semi-equivalence r e l a t i o n s is an important and useful tool for i n v e s t i g a t i n g c l a s s i f i c a t i o n , pattern r e c o g n i t i o n , p o l...
Zhang Mingyi