Sciweavers

2100 search results - page 306 / 420
» Fundamentals of the problem
Sort
View
CEC
2010
IEEE
13 years 10 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
ADHOC
2010
163views more  ADHOC 2010»
13 years 9 months ago
A probabilistic method for cooperative hierarchical aggregation of data in VANETs
We propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed paramete...
Christian Lochert, Björn Scheuermann, Martin ...
BMCBI
2010
164views more  BMCBI 2010»
13 years 9 months ago
Gene regulatory networks modelling using a dynamic evolutionary hybrid
Background: Inference of gene regulatory networks is a key goal in the quest for understanding fundamental cellular processes and revealing underlying relations among genes. With ...
Ioannis A. Maraziotis, Andrei Dragomir, Dimitris T...
CAD
2008
Springer
13 years 9 months ago
Constrained curve fitting on manifolds
When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a poin...
Simon Flöry, Michael Hofer
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 9 months ago
Blind Compressed Sensing
The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measuremen...
Sivan Gleichman, Yonina C. Eldar