Sciweavers

152 search results - page 15 / 31
» Efficiently Exploiting Dependencies in Local Search for SAT
Sort
View
AAAI
2006
14 years 11 months ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone
AE
2003
Springer
15 years 1 months ago
ParaDisEO-Based Design of Parallel and Distributed Evolutionary Algorithms
ParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the la...
Sébastien Cahon, Nordine Melab, El-Ghazali ...
JMLR
2008
159views more  JMLR 2008»
14 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...
SISAP
2010
IEEE
259views Data Mining» more  SISAP 2010»
14 years 7 months ago
kNN based image classification relying on local feature similarity
In this paper, we propose a novel image classification approach, derived from the kNN classification strategy, that is particularly suited to be used when classifying images descr...
Giuseppe Amato, Fabrizio Falchi