Sciweavers

2403 search results - page 349 / 481
» Optimal Randomized RANSAC
Sort
View
INFOCOM
2005
IEEE
15 years 9 months ago
Dynamic node activation in networks of rechargeable sensors
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
Koushik Kar, Ananth Krishnamurthy, Neeraj Jaggi
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 8 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
105
Voted
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
15 years 8 months ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf
IBPRIA
2009
Springer
15 years 8 months ago
Inference and Learning for Active Sensing, Experimental Design and Control
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
Hendrik Kück, Matthew Hoffman, Arnaud Doucet,...
109
Voted
ATAL
2008
Springer
15 years 5 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis