Sciweavers

2899 search results - page 333 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 10 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
SIAMJO
2010
136views more  SIAMJO 2010»
15 years 1 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ADHOCNOW
2008
Springer
16 years 27 days ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
APCCAS
2006
IEEE
323views Hardware» more  APCCAS 2006»
16 years 19 days ago
Real-Time Implementation of a Particle Filter with Integrated Voice Activity Detector for Acoustic Speaker Tracking
— In noisy and reverberant environments, the problem of acoustic source localisation and tracking (ASLT) using an array of microphones presents a number of challenging difficult...
Anders M. Johansson, Eric A. Lehmann, Sven Nordhol...
TSP
2008
114views more  TSP 2008»
15 years 6 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer