Sciweavers

727 search results - page 48 / 146
» Private approximation of search problems
Sort
View
FM
2006
Springer
146views Formal Methods» more  FM 2006»
14 years 1 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
AAAI
1998
13 years 11 months ago
Applying Online Search Techniques to Continuous-State Reinforcement Learning
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
Scott Davies, Andrew Y. Ng, Andrew W. Moore
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 2 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 10 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
PPSN
2004
Springer
14 years 3 months ago
Indicator-Based Selection in Multiobjective Search
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...
Eckart Zitzler, Simon Künzli