Sciweavers

4894 search results - page 563 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
15 years 11 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
ICRA
2007
IEEE
178views Robotics» more  ICRA 2007»
15 years 11 months ago
Distributed Cooperative Active Sensing Using Consensus Filters
— We consider the problem of multiple mobile sensor agents tracking the position of one or more moving targets. In our formulation, each agent maintains a target estimate, and ea...
Peng Yang, Randy A. Freeman, Kevin M. Lynch
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 10 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
ICANN
2007
Springer
15 years 10 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 10 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...